TOP 15 IMPORTANT PROGRAMS FOR INTERVIEWS WITH SOLUTION : Here are the Top 15 recently asked programs in various interviews like TCS, INFOSYS, WIPRO, ACCENTURE & other service-based companies :-

TOP 15 IMPORTANT PROGRAMS FOR INTERVIEWS WITH SOLUTION
1.Prime Number Program:
Prime Number: A number that is greater than 1 & divided by 1 or itself
- #include<stdio.h>
- int main(){
- int n,i,m=0,flag=0;
- printf(“Enter the number to check prime:”);
- scanf(“%d”,&n);
- m=n/2;
- for(i=2;i<=m;i++)
- {
- if(n%i==0)
- {
- printf(“Number is not prime”);
- flag=1;
- break;
- }
- }
- if(flag==0)
- printf(“Number is prime”);
- return 0;
- }
Output:
Enter the number to check prime:56 Number is not prime Enter the number to check prime:23 Number is prime
2. Fibonacci Series:
Fibonacci: When next number is the sum of given 2 number then the series is called Fibonacci Series.
Example: 0, 1, 1, 2, 3, 5, 8….
- #include<stdio.h>
- int main()
- {
- int n1=0,n2=1,n3,i,number;
- printf(“Enter the number of elements:”);
- scanf(“%d”,&number);
- printf(“\n%d %d”,n1,n2);//printing 0 and 1
- for(i=2;i<number;++i)//loop starts from 2 because 0 and 1 are already printed
- {
- n3=n1+n2;
- printf(” %d”,n3);
- n1=n2;
- n2=n3;
- }
- return 0;
- }
The above program is Fibonacci Series without Recursion
- #include<stdio.h>
- void printFibonacci(int n){
- static int n1=0,n2=1,n3;
- if(n>0){
- n3 = n1 + n2;
- n1 = n2;
- n2 = n3;
- printf(“%d “,n3);
- printFibonacci(n-1);
- }
- }
- int main(){
- int n;
- printf(“Enter the number of elements: “);
- scanf(“%d”,&n);
- printf(“Fibonacci Series: “);
- printf(“%d %d “,0,1);
- printFibonacci(n-2);//n-2 because 2 numbers are already printed
- return 0;
- } ‘
The above Program is Fibonacci Series with Recursion
3.Factorial Number Program
Factorial: Factorial is represented as “5!” that means, 5*4*3*2*1
- #include<stdio.h>
- int main()
- {
- int i,fact=1,number;
- printf(“Enter a number: “);
- scanf(“%d”,&number);
- for(i=1;i<=number;i++){
- fact=fact*i;
- }
- printf(“Factorial of %d is: %d”,number,fact);
- return 0;
- }
4. Pattern Program:
- #include <stdio.h>
- #include <conio.h>
- void main()
- {
- int i, j, rows, k = 0;
- printf (” Enter a number to define the rows: \n”);
- scanf (“%d”, &rows);
- for ( i =1; i <= rows; i++)
- {
- for ( j = 1; j <= rows – i; j++)
- {
- printf (” “);
- }
- // use for loop where k is less than equal to (2 * i -1)
- for ( k = 1; k <= ( 2 * i – 1); k++)
- {
- printf (“* “); // print the Star
- }
- printf (“\n”);
- }
- getch();
- }
Output:
*
* *
* * *
5. Sum of Digits in a Program:
- #include<stdio.h>
- int main()
- {
- int n,sum=0,m;
- printf(“Enter a number:”);
- scanf(“%d”,&n);
- while(n>0)
- {
- m=n%10;
- sum=sum+m;
- n=n/10;
- }
- printf(“Sum is=%d”,sum);
- return 0;
- }
Output:
Enter a number:654
Sum is=15
Enter a number:123
Sum is=6
6. Given Number is Palindrome Number or not:
Palindrome: Palindrome is a number that is same even after reverse.
Example: 121, 34543
- #include<stdio.h>
- int main()
- {
- int n,r,sum=0,temp;
- printf(“enter the number=”);
- scanf(“%d”,&n);
- temp=n;
- while(n>0)
- {
- r=n%10;
- sum=(sum*10)+r;
- n=n/10;
- }
- if(temp==sum)
- printf(“palindrome number “);
- else
- printf(“not palindrome”);
- return 0;
- }
Output:
Given Number: 151
The Number is Palindrome
7. Given Number is Leap Year is not?
#include <stdio.h>
int main()
{
int year;
printf("Enter a year to check if it is a leap year\n");
scanf("%d", &year);
if ( year%400 == 0)
printf("%d is a leap year.\n", year);
else if ( year%100 == 0)
printf("%d is not a leap year.\n", year);
else if ( year%4 == 0 )
printf("%d is a leap year.\n", year);
else
printf("%d is not a leap year.\n", year);
return 0;
}
Output of program:
Enter a year to check it is a leap year or not
2012
2012 is not a leap year
8. Given Number is Armstrong Number or Not?
Armstrong Number: It is a number that is sum of cubes of its number.
For example take a number: 371
Logic:
- 371 = (3*3*3)+(7*7*7)+(1*1*1)
- where:
- (3*3*3)=27
- (7*7*7)=343
- (1*1*1)=1
- So:
- 27+343+1=371
Program:
#include<stdio.h>
int main()
{
int n,r,sum=0,temp;
printf(“enter the number=”);
scanf(“%d”,&n);
temp=n;
while(n>0)
{
r=n%10;
sum=sum+(r*r*r);
n=n/10;
}
if(temp==sum)
printf(“armstrong number “);
else
printf(“not armstrong number”);
return 0;
}
9. Given Number is Strong or Not:
Strong Number: If sum of the factorial of the individual digits is equal to the number.
Program:
- #include <stdio.h>
- int main()
- {
- int n;
- int sum=0;
- printf(“Enter a number”);
- scanf(“%d”,&n);
- int k=n;
- int r;
- while(k!=0)
- {
- r=k%10;
- int f=fact(r);
- k=k/10;
- sum=sum+f;
- }
- if(sum==n)
- {
- printf(“\nNumber is a strong”);
- }
- else
- {
- printf(“\nNumber is not a strong”);
- }
- return 0;
- }
- int fact(int r)
- {
- int mul=1;
- for(int i=1;i<=r;i++)
- {
- mul=mul*i;
- }
- return mul;
- }
10. Given Number is Perfect Number or not?
Perfect Number:
- #include<stdio.h>
- #include<conio.h>
- void main()
- {
- int i = 1, num, Sum = 0;
- printf(” Enter any number to check Perfect Number \n”);
- scanf(“%d”, &num);
- while(i < num )
- {
- if(num % i == 0)
- Sum = Sum + i;
- i++;
- }
- if(Sum == num)
- printf(“\n %d is Perfect Number”, num);
- else
- printf(“\n %d is not a Perfect Number”, num);
- getch();
- }
11. Swapping of 2 numbers without using the 3rd Number:
- #include<stdio.h>
- int main()
- {
- int a=10, b=20;
- printf(“Before swap a=%d b=%d”,a,b);
- a=a+b;//a=30 (10+20)
- b=a-b;//b=10 (30-20)
- a=a-b;//a=20 (30-10)
- printf(“\nAfter swap a=%d b=%d”,a,b);
- return 0;
- }
12. Harshad Number for TOP 15 IMPORTANT PROGRAMS FOR INTERVIEWS WITH SOLUTION:
If a number is divisible by the sum of its digits then it will be known as a Harshad Number.
For example:
156 is divisible by the sum (12) of its digits (1, 5, 6 ).
- #include <stdio.h>
- int main()
- {
- int num = 156;
- int rem = 0, sum = 0, n;
- //Make a copy of num and store it in variable n
- n = num;
- //Calculates sum of digits
- while(num > 0){
- rem = num%10;
- sum = sum + rem;
- num = num/10;
- }
- //Checks whether number is divisible by sum of digits
- if(n%sum == 0)
- printf(“%d is a harshad number”, n);
- else
- printf(“%d is not a harshad number”, n);
- return 0;
- }
13. Program to check whether a given number is EVEN or ODD for TOP 15 IMPORTANT PROGRAMS FOR INTERVIEWS WITH SOLUTION
#include <stdio.h>
int main() {
int num;
printf("Enter an integer: ");
scanf("%d", &num);
// true if num is perfectly divisible by 2
if(num % 2 == 0)
printf("%d is even.", num);
else
printf("%d is odd.", num);
return 0;
}
14. Reversing of Numbers For TOP 15 IMPORTANT PROGRAMS FOR INTERVIEWS WITH SOLUTION:
- #include<stdio.h>
- int main()
- {
- int n, reverse=0, rem;
- printf(“Enter a number: “);
- scanf(“%d”, &n);
- while(n!=0)
- {
- rem=n%10;
- reverse=reverse*10+rem;
- n/=10;
- }
- printf(“Reversed Number: %d”,reverse);
- return 0;
- }
15. Program to convert Decimal to Binary:
- #include<stdio.h>
- #include<stdlib.h>
- int main(){
- int a[10],n,i;
- system (“cls”);
- printf(“Enter the number to convert: “);
- scanf(“%d”,&n);
- for(i=0;n>0;i++)
- {
- a[i]=n%2;
- n=n/2;
- }
- printf(“\nBinary of Given Number is=”);
- for(i=i-1;i>=0;i–)
- {
- printf(“%d”,a[i]);
- }
- return 0;
- }
Output:
Enter the number to convert: 5
Binary of Given Number is=101
TOP 15 IMPORTANT PROGRAMS FOR INTERVIEWS WITH SOLUTION
This program can be written in C/JAVA/PYTHON (TOP 15 IMPORTANT PROGRAMS FOR INTERVIEWS WITH SOLUTION)
Join Telegram Group: Click Here
Latest Government Job Notification