ROUND 1 – Written Test
There are many patterns for first round such as (Aptitude + C), (Flowchart + C)… For me, it is Flowchart + C.
If you are good at dry run you will surely clear this round. Problems consist of complex loops and nested loops.
Mostly we need to predict the output and statements which would give the desired output.
There will be no multiple choice questions.
ROUND 2 – PROGRAMMING ROUND – 1
Try using C language. Because for me they didn’t allow languages other than C.
1. Find the maximum of three numbers?
2. Print the total number of odd and even digits in the given number.
Ex. Input : 1234567
Output : ODD 4
EVEN 3
3. Find the second maximum among the given numbers.
Ex. INPUT :
Size of Array : 8
Enter the elements : 2 5 1 6 2 6 7 10
OUTPUT :
7
Ex. INPUT :
Size of Array : 4
Enter the elements : 4 1 2 2
OUTPUT :
2
Ex. INPUT :
Size of Array : 1
Enter the elements : 1
OUTPUT :
No second maximum
4. Print the following pattern
Ex. INPUT : 5
OUTPUT :
1
1 1
1 2 1
1 3 3 1
1 4 6 4 1
Ex. INPUT : 7
OUTPUT :
1
1 1
1 2 1
1 3 3 1
1 4 6 4 1
1 5 10 10 5 1
1 6 15 20 15 6 1
5. Given a two dimensional array which consists of only 0’s and 1’s. Print the matrix without duplication.
Ex. INPUT :
Enter Row Size : 4
Enter column size : 3
Enter the matrix :
1 0 1
1 1 0
1 1 1
1 0 1
OUTPUT :
Unique Matrix :
1 0 1
1 1 0
1 1 1
6. Given an array of positive numbers. Print the numbers which have longest continuous range.
Ex. INPUT :
Enter array size : 8
Enter arryay elements : 1 3 10 7 9 2 4 6
OUTPUT :
1 2 3 4
Ex. INPUT :
Enter array size : 8
Enter arryay elements : 1 3 9 7 8 2 4 6
OUTPUT :
1 2 3 4
6 7 8 9
7. Given two arrays. Find its union.
Input :
Enter size of first array : 6
Enter the elements : 1 2 3 4 5 3
Enter size of second array : 4
Enter the elements : 1 2 7 5
OUTPUT :
1 2 3 4 5 7
8. Given an array of numbers. Print the numbers without duplication.
INPUT :
Enter the array size : 4
Enter the elements : 1 1 2 4
OUTPUT :
1 2 4
9. Given an array of numbers and a number k. Print the maximum possible k digit number which can be formed using given numbers.
INPUT :
Enter the array size : 4
Enter the elements : 1 4 973 97
Enter number of digits : 3
OUTPUT :
974
INPUT :
Enter the array size : 6
Enter the elements : 1 4 89 73 9 7
Enter number of digits : 5
OUTPUT :
98973
10. Given an array of numbers and a window of size k. Print the maximum of numbers inside the window for each step as the window moves from the beginning of the array.
INPUT :
Enter the array size : 8
Enter the elements : 1,3,5,2,1,8,6,9
Enter the window size : 3
OUTPUT :
5 5 5 8 8 9
ROUND – 3 ADVANCED PROGRAMMING
1. Given a MxN matrix filled with ‘-‘ and you need to drop the balloons in the desired columns starting from the bottom. You need to print the matrix when a new balloon is dropped.
You need to continue getting inputs until the box is full or until the user chooses to stop.
TEST CASE :
Enter the matrix size(m*n) : 3 3
Enter the column number : 2
Enter the color of the balloon : R
Contents of the matrix :
- - -
- - -
- R -
Do you wish to continue(Y/N) : Y
Enter the column number : 2
Enter the color of the balloon : B
Contents of the matrix :
- - -
- B -
- R -
Do you wish to continue(Y/N) : Y
Enter the column number : 1
Enter the color of the balloon : R
Contents of the matrix :
- - -
- B -
R R -
Do you wish to continue(Y/N) : Y
Enter the column number : 2
Enter the color of the balloon : R
Contents of the matrix :
- R -
- B -
R R -
Do you wish to continue(Y/N) : N
Program Stopped
2. Extended version of the previous problem. Now you need to quit when a row become filled completely.
TEST CASE :
Enter the matrix size(m*n) : 3 3
Enter the column number : 2
Enter the color of the balloon : R
Contents of the matrix :
- - -
- - -
- R -
Do you wish to continue(Y/N) : Y
Enter the column number : 2
Enter the color of the balloon : B
Contents of the matrix :
- - -
- B -
- R -
Do you wish to continue(Y/N) : Y
Enter the column number : 2
Enter the color of the balloon : R
Contents of the matrix :
- R -
- B -
- R -
Column is filled completely. Program is terminated.
3. Extended version of the previous problem. Now you need to drop balloon in the first free cell from left if the specified column is filled in every row.
TEST CASE :
Enter the matrix size(m*n) : 3 3
Enter the column number : 2
Enter the color of the balloon : R
Contents of the matrix :
- - -
- - -
- R -
Do you wish to continue(Y/N) : Y
Enter the column number : 2
Enter the color of the balloon : B
Contents of the matrix :
- - -
- - -
B R -
Do you wish to continue(Y/N) : Y
Enter the column number : 2
Enter the color of the balloon : R
Contents of the matrix :
- - -
- - -
B R R
Do you wish to continue(Y/N) : Y
Enter the column number : 2
Enter the color of the balloon : R
Contents of the matrix :
- - -
- R -
B R R
Do you wish to continue(Y/N) : Y
Enter the column number : 2
Enter the color of the balloon : B
Contents of the matrix :
- - -
B R -
B R R
Do you wish to continue(Y/N) : N
Program terminated.
4. Extended version of the previous problem. If any column has three continuous balloons of same colors then we need to burst them.
TEST CASE :
Enter the matrix size(m*n) : 3 3
Enter the column number : 2
Enter the color of the balloon : R
Contents of the matrix :
- - -
- - -
- R -
Do you wish to continue(Y/N) : Y
Enter the column number : 2
Enter the color of the balloon : R
Contents of the matrix :
- - -
- - -
R R -
Do you wish to continue(Y/N) : Y
Enter the column number : 2
Enter the color of the balloon : R
Contents of the matrix :
- - -
- - -
R R R
Do you wish to continue(Y/N) : Y
Enter the column number : 2
Enter the color of the balloon : R
Contents of the matrix :
- - -
- R -
R R R
Do you wish to continue(Y/N) : Y
Enter the column number : 2
Enter the color of the balloon : B
Contents of the matrix :
- - -
R R -
R R R
Do you wish to continue(Y/N) : Y
Enter the column number : 2
Enter the color of the balloon : R
Contents of the matrix :
- - -
R R R
R R R
Do you wish to continue(Y/N) : Y
Enter the column number : 2
Enter the color of the balloon : R
Contents of the matrix :
- - -
R - R
R - R
Do you wish to continue(Y/N) : N
Program Terminated.
5. Extended version of the previous problem. Now you need to burst the three continuous colors in the same row.
Technical HR
The number of technical HR rounds may vary depending on your performance in the previous HR rounds. Some of them were sent to incubation if they weren’t convincing for the HRs.
Questions were from Java, Data structures, approach for the given scenario, databases, and logical apps.
General HR
Simple questions like why Zoho, any other current offers, about Zoho, about family, why did you choose CSE, higher studies,…
Please don’t ask for answers. Try to solve it yourself or find it yourself.