ROUND 1 - Aptitude and Coding

I received mail on feb 9 that I have round one scheduled on feb 14(saturday).

• Round 1 was conducted offline at the Zoho office with pen and paper.
• Round 1 consists of 10 Aptitude and 10 Programming questions
• 1 hr to solve 20 questions
• There will be no options to choose from only fill ups
• Aptitude was the hardest coding questions were in C++(no other language option).
• We have write the output for the given code.
• At first round we had around 200 pepole.

Round 2 - Coding Problem Solutions

I received mail on feb 23 that I have the following rounds on feb 25.

• Round 2 consists of 3 coding questions with 3 hrs to solve .

• These questions has to solved without using collections(no arraylist,hashset,hashmap,stack,queue,....).

• The questions has to be solved one by one without changing the order.
• Company laptops were provided without internet.
• We can solve the questions in any IDE(VS code / Intellij) (no internet so no AI help)(VS code had Redhat java extension so built in method name was autocompleted).
• There were 3 to 4 HR pepole watching us .
• Once solving a question we have to explain the code to the HR and then only they will give you a random test case to see if your code will solve it.Then only we can move to next question(after getting HR approval).
• There were 40 (approx.) people in round 2 .

The 3 questions are,

1. Row and Column sizes are given as input for that we have to create a matrix and store it with fibonacci sequence in spiral order.
   
2. You will be given n number of location . You can move from one location to the next in both forward and backward . But can't move from last to first (that is no loop).
   Then an array will be given with the some marked locations .
   You will have to find the minimum distance taken by each location to go to the marked location .
   Then find maximum distance from the previous distances.

//Question 2
if n = 5 and arr={1,3} ("then 1 and 3 are marked but 2,4,5 are not marked")

At location 1 : it is marked so '0' distance.
At location 2 : distace to 1 is '1' and distance to 3 is '1' so min is 1.
At location 3 : it is marked so '0' distance.
At location 4 : distace to 1 is '3' and distance to 3 is '1' so min is 1.
At location 5 : distance to 1 is '4' and distance to 3 is '2' so min is 2.

At last the maximum distance form the above minimum distance is 2 .
So the answer is '2'.

3. You are provided an array with elements as power of 2(0,2,4,8) You have to move non-zero elements in an array to the left . While moving the zeros to the right, if two consecutive same elements comes then you can add them.This is the logic for move left .

Move right has the same logic with direction switched.

//Question 3
move left

{4 ,4 ,2 ,0 ,2 } ----> {8 ,4 ,0 ,0 ,0 }

{8 ,0 ,4 ,4 ,2 } ----> {8 ,8 ,2 ,0 ,0 } 

Round 3 - LLD (Low Level Design)

• At Round three there were 5 people only.
• We have to create a console based game application using OOPS
• We were asked create a map for given size (I used a 2d array) with

 Player location marked as 'P' 
 Key location marked as 'K' 
 Walls marked as '*'
 Bricks location marked as 'B'
 Vilains location marked as 'V'

• Walls will be permanently marked in a pattern and will never change.
• The index will be marked as A,B,C,D,E.... at before first row and first column.
• Input will be like the following.

Map size : 10
Player Position: BB
Key Position: DF
Villian count :2
CB
FF
Bricks count :4
CF
FB
ED
BE

  A B C D E F G H J
A * * * * * * * * *
B * P             *
C * V *   * B *   *
D *         K     *
E *   * B *   *   *
F * B       V     *
G *   *   *   *   *
H *               *
J * * * * * * * * *

• LEVEL 1

• We have to get the input from the user and print the map.

• LEVEL 2

• The player can move one block using 'W S A D' for up,down,left and right. 'Q E Z C' for diagonal movement.
• The player cannot move on top of a brick or wall.
• If the player steps on a villian he will die (GAME OVER).
• If the player steps on the key he wil win the game.
• If the player presses 'X' he will drop a bomb marked in the map by 'X' .
• Once he moves form the location the bomb will explode and kill vilians and bricks in the adjacent positions.

• There are totally 6 level but I only completed upto 2 levels

• There is still more rounds to come .

• Lunch will be provided.

Update:

• I completed upto level 2 in Round 3 .
• I received mail on feb 27 that I got rejected.