Skip to main content

Tricky Questions or puzzles in C Part 3

Thank You for the amazing response to the previous two posts on Tricky questions on C. In this post, we will again see some of the nice and interesting questions often asked in the interviews.




1) How to calculate the Factorial of the number without using Recursion and Loop?

Calculating factorial is very simple using recursion or loop, but how to calculate factorial without using anything?

Using the sterling´s approximation for the factorial, which is given by the formula


n! = sqrt(2*pi*n)*pow((n/e),n) 

Please note that this formula will not give the exact value of the factorial because it is just the approximation of the factorial.

I understand that it is not a "Tricky" question but it depends on the knowledge of the person about this formula, so if somebody has seen the formula then only he can answer the question.

This is the rough code for calculating the above (may not work with large numbers)

int main
{
int a;
float e,y,x,z;
scanf("%d",&a);

e=2.71;
y=a/e;
x=2*3.14*a;
z=sqrt(x)*pow(y,a);
printf("Factorial:%f",z);
}

2) How to print "HelloWorld" without using a semicolon?

int main()
{
if (printf("HelloWorld"))
{
}
}

Also, check my below the post to get Tricky puzzles in JAVA.
Tricky questions or puzzles in JAVA

3) What is the output of the below code snippet?

int main()
{
int a;
if (a=printf("HelloWorld")+4)
{
printf("%d", a);
}

Output : HelloWorld 14

4) What is the output of the below code snippet?

int main()
{
int a;
if (a=printf("HelloWorld"+4))
{
printf("%d", a);
}

Output : oWorld 6

To see the previous post on tricky questions on C, click the below links

Tricky questions in C part 1
Tricky questions in C part 2

Comments

Popular posts from this blog

Tricky Questions or Puzzles in C ( Updated for 2026)

Updated for 2026 This article was originally written when C/C++ puzzles were commonly asked in interviews. While such language-specific puzzles are less frequent today, the problem-solving and logical reasoning skills tested here remain highly relevant for modern Software Engineering, Data Engineering, SQL, and system design interviews . Why These Puzzles Still Matter in 2026 Although most Software &   Data Engineering interviews today focus on Programming, SQL, data pipelines, cloud platforms, and system design , interviewers still care deeply about how you think . These puzzles test: Logical reasoning Edge-case handling Understanding of execution flow Ability to reason under pressure The language may change , but the thinking patterns do not . How These Skills Apply to Data Engineering Interviews The same skills tested by C/C++ puzzles appear in modern interviews as: SQL edge cases and NULL handling Data pipeline failure scenarios Incremental vs ...

Program to uncompress a string ie a2b3c4 to aabbbcccc

Below is the program to uncompress a string #include<stdio.h> #include<conio.h> #include<stdlib.h> int main() { char str[100]="a2b3c4d8u7"; for(int i=0;str[i]!='\0';i++) { if(i%2!=0) { for(int j=0;j<atoi(&str[i]);j++) { printf("%c",str[i-1]); } } } getch(); } Want to become a Data Engineer? Check out below blog posts  1.  5 Key Skills Every Data Engineer needs in 2023 2.  How to prepare for Data Engineering Interviews 3.  Top 25 Data Engineer Questions

Programs and Puzzles in technical interviews i faced

I have attended interview of nearly 10 companies in my campus placements and sharing their experiences with you,though i did not got selected in any of the companies but i had great experience facing their interviews and it might help you as well in preparation of interviews.Here are some of the puzzles and programs asked to me in interview in some of the good companies. 1) SAP Labs I attended sap lab online test in my college through campus placements.It had 3 sections,the first one is usual aptitude questions which i would say were little tricky to solve.The second section was Programming test in which you were provided snippet of code and you have to complete the code (See Tricky Code Snippets  ).The code are from different data structures like Binary Tree, AVL Tree etc.Then the third section had questions from Database,OS and Networks.After 2-3 hours we got the result and i was shortlisted for the nest round of interviews scheduled next day.Then the next day we had PPT of t...