Round 1: Written test
The first round comprised of 25 one mark questions (without options) from C output questions and puzzle & general aptitude questions (Test Duration: 2 hour)
C output questions part covered questions from iterations, pointers, array and data structures.
Tips :- Solve the technical apt questions first and don’t stress yourself. Try to solve general apt after solving technical questions. (If you are strong in technical, it is easy to clear this written test)
Round 2: Coding round
You will be provided laptop and turbo C compiler. Java , C++ also allowed for second round.
*********STRICTLY NO INBUILT FUNCTIONS**********
Some of the questions are.
1. Find the extra element and its index
Input : [ 10, 20, 30, 12, 5 ] [ 10, 5, 30, 20 ] Output : 12 is the extra element in array 1 at index 4 Input : [ -1, 0, 3, 2 ] [ 3, 4, 0, -1, 2 ] Output : 4 is the extra element in array 3 at index 5
2. Find the least prime number that can be added with first array element that makes them divisible by second array elements at respective index (check for prime numbers under 1000, if exist return -1 as answer) & (Consider 1 as prime number)
Input : [ 20, 7 ] [ 11, 5 ] Output : [ 1, 3 ] Explanation : (20 + ?) % 11 ( 7 + ?) % 5
Input : [ 2 2 3 4 5 12 2 3 3 3 12 ] Output : 3 3 3 3 2 2 2 12 12 4 5
Explanation : 3 occurred 4 times, 2 occurred 3 times, 12 occurred 2 times, 4 occurred 1 time, 5 occurred 1 time
Input : [ 0 -1 2 1 0 ] Output : 0 0 -1 1 2
Note : sort single occurrence elements in ascending order
Note : * symbol can replace n number of characters Input : Spoon Sp*n Output : TRUE Zoho *o*o Output : TRUE Man n* Output : FALSE Subline line Output : TRUE
Round 3: Advance programming round
There were 8 modules
1. Display the position of Lift
Lift : L1 L2 L3 L4 L5 Floor: 0 0 0 0 0
2. Assign Lift to the users
Input : 2 5 Output : L1 is assigned Lift : L1 L2 L3 L4 L5 Floor: 5 0 0 0 0
3. Assign nearest lift by comparing their current positions
Lift : L1 L2 L3 L4 L5 Floor: 5 2 7 9 0 Input : 4 10 Output : L1 is assigned Lift : L1 L2 L3 L4 L5 Floor: 10 2 7 9 0
Explanation : L1 is near to 4 floor
4. If two lifts are nearest to the user’s source floor, the assign the lift with same direction of user’s requirement.
Example: if user request to move from 4 to 2 ,and if L3 is in 5th floor & L5 is in 3rd floor, then we should assign L3 because user requested for downward motion so L3 ill move down from 5th floor
5. Restrict L1 & L2 for 0-5th floor , L3 & L4 for 6-10th floor , L5 for 0-10th
Initially all lifts are at 0th floor.
6. Assign lift with least number of stops
If L3 is in 9th floor
And L5 is at 8nd floor
If user wants to move from 8 to 0
We should assign L3 because L3 ill stop at 8,7,6 and then 0 NumberOfStops = 3, but L5 ill stop at 8,7,6,5,4,3,2,1,0 and NumberOfStops = 8 so we should assign L3
7. Assign capacity (Number of people capable to travel) to all lift and assign according to the capacity
8. If any lift is under maintenance then their current position should be marked as “-1” and that lift should not be assigned at any cost.
Round 4 and 5: Interview (technical and HR)
In technical interview some puzzles and programming questions were asked. In HR interview some basic HR questions were asked.
- Zoho Interview Experience | Set 36 (Software Developer)
- Zoho Interview Experience for Software Developer
- Zoho Interview Experience | Set 30 (Off-Campus for Software developer)
- Zoho Interview Experience | Set 33 (Off-Campus for Software developer)
- Zoho Interview Experience | Set 29 (Off-Campus for Software Developer)
- Zoho Interview Experience | Set 39 (On-Campus Drive for Software Developer)
- Zoho Interview Experience | Set 37 (Java Developer)
- Amazon Interview Experience Offcampus for SDE-1
- Amazon Interview Experience | SDE-1 offcampus
- Zoho Off Campus Drive | Set 26 (Software Developer)
- Zoho On Campus Drive | Set 24 (Software Developer)
- Zoho On Campus Drive | Set 25 (Software Developer)
- Zoho Interview Experience | Set 9
- Zoho Interview Experience | Set 17
- Zoho Interview Experience | Set 16
If you like GeeksforGeeks and would like to contribute, you can also write an article using contribute.geeksforgeeks.org or mail your article to firstname.lastname@example.org. See your article appearing on the GeeksforGeeks main page and help other Geeks.
Please Improve this article if you find anything incorrect by clicking on the "Improve Article" button below.