# ZOHO Overall Interview Questions + Coding Solutions – codewindow.in

## Hot Topics

Topics

Introduction
Time Complexity
Stack
Stack using Queue
Infix To Postfix
Queue
Queue using Stack
Dequeue
Circular Queue
1. Insert First
2. Insert Last
3. Delete First
4. Delete Last
5. Insert After a Value
6. Insert Before a Value
7. Insert After Position
8. Insert Before Position
9. Delete After a Value
10. Delete Before Value
11. Delete Position
12. Display
13. Reverse Display
14. Physically Reverse Display
15. Free All Nodes
16. Node Count
17. Delete First nth Nodes
18. Delete Last nth Nodes
1. Insert First
2. Insert Last
3. Delete First
4. Delete Last
5. Insert After a Value
6. Insert Before a Value
7. Insert After Position
8. Insert Before Position
9. Delete After a Value
10. Delete Before Value
11. Delete Position
12. Display
13. Reverse Display
14. Physically Reverse Display
15. Free All Nodes
16. Node Count
17. Delete First nth Nodes
18. Delete Last nth Nodes
Searching
Linear Search
Binary Search
Jump Search
Interpolation Search
Exponential Search
“Sublist Search
(Search a linked list in another list)”
Fibonacci Search
The Ubiquitous Binary Search
“Recursive program to linearly search
an element in a given array”
Recursive function to do substring search
“Unbounded Binary Search Example
(Find the point where a monotonically increasing
function becomes positive first time)”
Sorting
Selection Sort
Bubble Sort
Recursive Bubble Sort
Insertion Sort
Recursive Insertion Sort
Merge Sort
Iterative Merge Sort
Quick Sort
Iterative Quick Sort
Heap Sort
Counting Sort
Bucket Sort
ShellSort
TimSort
Comb Sort
Pigeonhole Sort
Cycle Sort
Cocktail Sort
Strand Sort
Bitonic Sort
Pancake sorting
Binary Insertion Sort
BogoSort or Permutation Sort
Gnome Sort
“Sleep Sort –
The King of Laziness / Sorting while Sleeping”
Structure Sorting (By Multiple Rules) in C++
Stooge Sort
Tag Sort (To get both sorted and original)
Tree Sort
Cartesian Tree Sorting
Odd-Even Sort / Brick Sort
3-Way QuickSort (Dutch National Flag)
Merge Sort for Doubly Linked List
3-way Merge Sort
Polynomial Functions
Recursion
Factorial Using Recursion:
Fibonacci Using Recursion:
GCD Using Recursion:
Tower of Hanoi Using Recursion:
N Queen Problem
Knapsack Problem
Tree
Graph
BFS
DFS

## ZOHO Solution

#### Write a code for the palindrome of a number.

``````#include<stdio.h>

int main() {
int n,m,sum=0,temp;
printf("Enter the number you want to check\n");
scanf("%d",&amp;n);

temp=n;
while(n&gt;0){
m=n%10;
sum=(sum*10)+m;
n=n/10;
}

if(temp==sum){
printf("It's a palindrome number");
}
else{
printf("It's not a palindrome number");
}

return 0;
}
/*
output:
Enter the number you want to check:121
121 , It's a palindrome number
*/``````

#### Write a code for the factorial of a number.

``````#include<stdio.h>
int fact(int);

int main()
{
int n=5;
printf("%d",fact(n));

return 0;
}

int fact(int n){
if(n==1){
return 1;
}

return n*fact(n-1);
}

/*
OUTPUT:
120
*/``````

## Hot Topics

Topics

Introduction
Time Complexity
Stack
Stack using Queue
Infix To Postfix
Queue
Queue using Stack
Dequeue
Circular Queue
1. Insert First
2. Insert Last
3. Delete First
4. Delete Last
5. Insert After a Value
6. Insert Before a Value
7. Insert After Position
8. Insert Before Position
9. Delete After a Value
10. Delete Before Value
11. Delete Position
12. Display
13. Reverse Display
14. Physically Reverse Display
15. Free All Nodes
16. Node Count
17. Delete First nth Nodes
18. Delete Last nth Nodes
1. Insert First
2. Insert Last
3. Delete First
4. Delete Last
5. Insert After a Value
6. Insert Before a Value
7. Insert After Position
8. Insert Before Position
9. Delete After a Value
10. Delete Before Value
11. Delete Position
12. Display
13. Reverse Display
14. Physically Reverse Display
15. Free All Nodes
16. Node Count
17. Delete First nth Nodes
18. Delete Last nth Nodes
Searching
Linear Search
Binary Search
Jump Search
Interpolation Search
Exponential Search
“Sublist Search
(Search a linked list in another list)”
Fibonacci Search
The Ubiquitous Binary Search
“Recursive program to linearly search
an element in a given array”
Recursive function to do substring search
“Unbounded Binary Search Example
(Find the point where a monotonically increasing
function becomes positive first time)”
Sorting
Selection Sort
Bubble Sort
Recursive Bubble Sort
Insertion Sort
Recursive Insertion Sort
Merge Sort
Iterative Merge Sort
Quick Sort
Iterative Quick Sort
Heap Sort
Counting Sort
Bucket Sort
ShellSort
TimSort
Comb Sort
Pigeonhole Sort
Cycle Sort
Cocktail Sort
Strand Sort
Bitonic Sort
Pancake sorting
Binary Insertion Sort
BogoSort or Permutation Sort
Gnome Sort
“Sleep Sort –
The King of Laziness / Sorting while Sleeping”
Structure Sorting (By Multiple Rules) in C++
Stooge Sort
Tag Sort (To get both sorted and original)
Tree Sort
Cartesian Tree Sorting
Odd-Even Sort / Brick Sort
3-Way QuickSort (Dutch National Flag)
Merge Sort for Doubly Linked List
3-way Merge Sort
Polynomial Functions
Recursion
Factorial Using Recursion:
Fibonacci Using Recursion:
GCD Using Recursion:
Tower of Hanoi Using Recursion:
N Queen Problem
Knapsack Problem
Tree
Graph
BFS
DFS

## We Loveto Support you

Go through our study material. Your Job is awaiting.