ZOHO INTERVIEW EXPERIENCE

Round 1 - Online
● Basic and intermediate C MCQ
● Aptitude (Problems on averages, time and work, Permutations and Combinations

Round 2 - Coding
● Strings
● 2D-Array
● Number generation

Round 3 - Advanced Coding

● Module by Module development - Chain reaction Game

Round 4 - Technical And Personal HR

● Technical questions from important concepts
● Questions based on Area of interest
● Personal questions

ROUND 1: C AND APTITUDE MCQ (ONLINE)

The first round had 15 C programming question and 15 aptitude question. Total time
provided for the round is 1 hour 30 minutes. So we are provided enough time required to
solve 30 questions.

C programming questions were asked in the topics like strings, arrays, pointers,
structures, union, and functions. Aptitude questions were asked about the topics like work
and time, permutations, combinations, Number prediction, and some logically thinking
questions.

I started the test with C programming questions. The questions look very simple and
actually, they are not. Deep vision is a need for solving those kinds of questions. Better track
the flow of program’s logic roughly in the sheet provided. Try to complete the C
programming section within the halftime, because I didn't and it affected me in solving
aptitude questions. Aptitude questions are quite easy. If you had practiced aptitudes well,
you can solve them easily.

ROUND 2: CODING

The second round had 8 programming question. Total time provided for the round is
3 hour. Unlike the previous round which is made in online, this round has no time constraints
and invigilators were not so strict with the time. We are allowed to work in any offline
compilers available in the machine and in any programming languages we are comfortable
with. After finishing the question, we intimate to the invigilators and they will note the remarks
about our program and our logic. we are allowed to solve the question only if the previous
question is solved.

Programming question was asked in the topics like Strings, two -

dimensional arrays (matrix), and some number generation with given constraints
kind of question.
1. Program to group the odd indexed element in the string together and even indexed
elements together.

I/p: a1b2c3d4e5

O/p:abcde12345

2. Program to swap diagonal elements in the 2D array.

I/p: 1 2 3

456

780

O/p:3 2 1

456

087

3. Program to check whether the given String1 is a rotation of String2. I/p:

String1- abcd

String2-cdab

O/p: True

4. Program to move the first column to last, for given K times.

I/p:1 2 3

456

780

K=2

O/p:3 1 2

645

078
5. Program to sort the string in ascending order with respect to the number of occurrence
of elements in the array. If the number of occurrences are the same sort with their values.
 I/p:hellooo

O/p:ooolleh

ROUND 3: ADVANCED CODING

The third round had only one advanced programming question. Total time provided for the
round is 3 hour. In this round too, invigilators were not so strict with the time. We are
allowed to work in any offline compilers available in the machine and in any programming
languages we are comfortable with.

In this round, the question provided is divided into 5 levels, which are to be solved
one by one. After finishing one level, we intimate to the invigilators and they will note the
remarks about our program and our logic.

Question:

Create a chain reaction game.

Constraints:

Level 1:

There are two elements provided for the game namely Zo and Ho.

Create a two-dimensional square grid to the elements.

The corner grid can only hold maximum 2 atoms of an element and other border grid can
hold 3 and middle grids can hold 4.

Initially, there are no atoms in the grids.

Initially b( Max_capacity, Atom_count, Element)

(2,0,-) (3,0,-) (3,,0,-)(3,,0,-)(2,,0,-)

(3,0,-) (4,0,-) (4,0,-) (4,0,-) (3,0,-)

(3,0,-) (4,0,-) (4,0,-) (4,0,-) (3,0,-)

(3,0,-) (4,0,-) (4,0,-) (4,0,-) (3,0,-)

(2,0,-) (3,0,-) (3,,0,-)(3,,0,-)(2,,0,-)

Position and the element type is given as the input and placement of atom in the specific
position is the output.

While displaying the grids the element and its atom count should be displayed.

I/p: N=5

I/p: A2 Zo

A B C D E

1 - - - -

2 Zo1 - - - -

3 - - - - -

4 - - - - -

5 - - - - -

6 - - - - -

I/p: B3 Ho

A B C D E

1 - - - - -

2 Zo1 - - - -

3 - Ho1 - - -

4 - - - - -

5 - - - - -

6 - - - - -
 I/p: A2 Zo

A B C D E
1 - - - - -

2 Zo2 - - - -

3 - Ho1 - - -

4 - - - - -

5 - - - - -

6 - - - - -

Level 2:

When the number of atoms in the grid reaches its Max capacity, no more addition of atom to
the grid is allowed.

If an atom already exists in the grid only that type of atom can be added.

I/p: A1 Zo

A B C D E

1 Zo1 - - -

2 - - - - -

3 - - - - -

4 - - - - -

5 - - - - -

6 - - - - -
I/p: A1 Zo

A B C D E

1 Zo2 - - -

2 - - - - -

3 - - - - -

4 - - - - -

5 - - - - -

6 - - - - -

I/p: A1 Zo

O/p: Maximum capacity reached.

I/p: A1 Zo

A B C D E

1 Zo1 - - -

2 - - - - -

3 - - - - -

4 - - - - -

5 - - - - -

6 - - - - -

I/p: A1 Ho

O/p: Mismatched type of element.

Level 3:

When the number of atoms in the grid reaches its Max capacity, there should be an
explosion and scattering of atoms in all four directions.

After the scattering, the atoms in the four adjacent grids are converted to the type of
scattered one.

This scattering may also lead to other explosions in a chain reaction.

I/p: A1 Zo

A B C D E

1 Zo1 - - -

2 - - - - -

3 - - - - -

4 - - - - -

5 - - - - -

6 - - - - -

I/p: B1 Ho

A B C D E

1 Zo1 Ho1 - - -

2 - - - - -

3 - - - - -

4 - - - - -

5 - - - - -

6 - - - - -
I/p: A1 Zo

A B C D E

1 - Zo2 - - -

2 Zo1 - - - -
3 - - - - -

4 - - - - -

5 - - - - -

6 - - - - -

I/p: A1 Zo

A B C D E

1 Zo1 Zo2 - - -

2 Zo1 - - - -

3 - - - - -

4 - - - - -

5 - - - - -

6 - - - - -

I/p: A1 Zo

A B C D E

1 Zo1 - Zo1 - -

2 Zo2 Zo1 Zo1 - -

3 - - - - -

4 - - - - -

5 - - - - -

6 - - - - -
 Level 4:

In this level, the game should be made in a way that two players can play opposing
each other.

Each player should make one move, one after the other.

One player should make the Zo move and the other one should make the Ho move.

The game should be ended when an element does not exist in any of the grids. (i.e.
When only Zo is contained in grids or only Ho is contained in grids)

Level 5:

In this level, the game should be made as “vs computer”.

Only one player should be able to play, having the computer as the opponent.

Computer moves should be in a random manner(should be programmed as like).

The end of game constraint is the same.

ROUND 4: TECHNICAL AND PERSONAL HR

After finishing the third round, I was called for the technical HR round. Actually, I had
two technical HR rounds. Questions asked in these rounds are not so technical. They were
in the form, that can check your logical, technical and innovative
thinking. There are also some personal questions in these round.

Tell me about yourself.

why did you select this college, stream, our company?

Tell me what you know about our company.

Find an algorithm to convert the given analog time to its mirror time.

Discussion on the projects done by me (I was asked to present innovative ideas that can
be added to the project).

Some technical questions from DBMS, oops concept.

The final round was personal HR. The round had the same personal questions

asked in the previous rounds and some other personal questions.