In any round, if you have any doubts, don’t hesitate to ask the instructors from ZOHO.

They ‘ll help you.(They might give you one of the logics to solve a problem, if you don’t
have any ideas)
ROUND – 1
The first round in ZOHO’s recruitment process was Aptitude(10 questions) & C – based output finding questions(10
questions).It was not a MCQ test. There wouldn’t be any options for any question. But the difficulty level of the
questions were easy only . In aptitude they had covered concepts like Profit/Loss, Percentage, Probability, Speed,
Distance & Time, etc… in C – based questions they had covered concepts like pointers, loops & nested loops and
basics/fundamentals of C.

ROUND – 2
In this round we would be asked to solve 5 or 6 easy problems. For this round we have to install the required
compilers/code editors in our laptop. This round generally varies from one batch to another but for every batch. For
some batches they’ll give 5 or 6 questions and ask you to solve them all (We can prioritize the problems based on our
strengths and weaknesses). For some other batches (I was also in this batch and I have listed the questions asked to
me in the order they asked me to solve them) they will give only 2 questions at first. And among those 2 they will tell
us which program to do first. Only if we complete one problem, they will let us move on to the next problem. Even if
we complete a program, they will ask us to do it some other logic too.(This is not only to decrease time/space
complexity but to check whether we are able to think of other logics for the same question too).

1 – You will be provided with a 2D array(n x m). You have to generate a 1D array of elements from the given matrix
in spiral order.

I/P

mat = [ [1, 2, 3],

[4, 5, 6],

[7, 8, 9]]

O/P

Ans = [1, 2, 3, 6, 9, 8, 7, 4, 5]

2 – Given a 2D array(n x m). Rotate the array 90 degrees clockwise

I/P

mat = [ [1, 2, 3],

[4, 5, 6],

[7, 8, 9]]

O/P

Ans = [ [7, 4, 1],

[8, 5, 2],

[9, 6, 3]]

3 – Consider that there is a sorted array (in non – descending order) of length n. And then it gets rotated n(1 <= n
<= length of the array ) times. Now you have to find the smallest element in the array. (Rotated => removing the 1st
element and adding it to the last of the array)
Your algorithm must run in O(log N) time complexity.

I/P

arr = [ 3, 4, 7, 9, 1, 2]

O/P

Min = 1

4 – You would be provided with a string and a pattern. You have to print whether the pattern matches the string or
not. (String will have only lowercase English alphabets)(Pattern will have lowercase English alphabets, “*” , “.”)

“*” -> Represents any number of any combination of characters(n >= 0)

“.” -> Represents any 1 character(n == 1)

I/P

string = “abbacbaa”

pattern = ”ab*b.a”

O/P

True

5 – Decrypting the given string. The string will contain lowercase English characters, positive integers, [lowercase
English alphabets enclosed by square brackets( “[ ]”). All the square brackets will have a positive integer before
them. And the characters inside the “[ ]” should be printed n times continuously in the output.( Eg. If the string is
n[abc] then the output should be abcabcabc…. (n times))

I/P

string = “abc2[abcd2[efg]1[ab]]abcd”

O/P
ans = “abcabcdefgefgababcdefgefgababcd”

6 – You will be provided with an array of integers(arr), a target value(target) and the maximum number of times
each variables can be used(n). You should print the number of possible ways to get the target sum.

I/P

N=5

arr = [ 100, 200, 500]

target = 1000

O/P

ROUND – 3
In this round we were asked to develop a library management system (Using OOPS concepts)

You would be given with the overview and the requirements for the application.

You would be provided with a series of tasks.(Similar to the previous round, you should complete the tasks one by
one and only if your instructor permits you to do next task, you should move on to the next question)
 ROUND – 4
This is the final round (technical & HR Interview)

In technical interview they would the things you have added in your resume. Most likely they will start from asking
about your internships and projects. And then based on your answers they will ask the further questions.

I ‘ve listed few questions that I was asked during my interview

1) Tell me about yourself (The interviewer was keen on my general strengths and weaknesses rather than my
technical skills in this question)
2) How did you manage time as you were studying in college and doing work in the internship at the same
period of time?
3) What was your role in that internship?(He mentioned a specific company)
4) What are your 3 favourite subjects/domains?
5) In each domain/subject, specify your 2 favourite concepts.
6) Then I was asked about those concepts.
7) I was asked to prove Pythagoras theorem in Mathematics(Because I said, “I am good in Mathematics and
Logical Thinking”)
8) Once I proved it, he read my resume once again and started to ask questions relevant to my skills.
9) Then another question from the previous round related to HashMap and HashSet.
10) Then from Data Structures I was asked several questions(Most of them were related to Trees, Graphs & Linked
Lists)
11) Then he asked me about “Why did I choose Computer Science after completing school”?
12) Then why B.E. CSE and not B.Sc Computer Science?
13) Then some questions related to my family.
14) Some questions related to my parents’ job and my help/contribution in them.
15) Them some questions about the changes that I would make, if I get appointed to their roles.
16) Some other general questions like these.