Traveloka Interview Experience | On -Campus 2019

Eligibility: Resume Shortlisting or 7+ CGPA

Round 1- MCQs:
50 MCQS in 55 minute
MCQs were C++ output based.
Eg. calling main() in the main function, static variable, constant variable, recursion, pointer, string manipulation, most of the MCQs were from gfg.

Round 2- Coding round:
Q1. A company has one stage, many events are scheduled at different time slots. Only one event can be scheduled at a time. We have to find the maximum number of events that can be scheduled. Input: startTime[ ], endTime[ ].
Q2. Given a string, we have to replace the minimum number of characters such that all adjacent characters are different. We have to return the minimum number of replacements needed.
4 MCQs based on probability, general maths, and DP.

Round 3 – Skype Interview ( 1.5 hr):
Q1. Introduce Yourself
Q2. In a directed graph, you need to tell the node from which all other nodes can be visited. Code the brute force solution and dry run it for the given test cases.
Q3. Optimise the previous solution.
Q4. Detect loop in a linked list.
Q5. Prove the correctness of the previous solution.
Q6. Write a code to distribute c chocolates among n students such that the sum of the absolute difference of the chocolate received by the adjacent students ( abs( (ai)-(ai+1) ) ) is minimum. ( O(1) time )
Eg. 2 3 4 1 3 chocolates distributed to 5 students than sum is 7.
Q7. In the previous solution ( after chocolate distribution ) rearrange the students in such a way that the sum of the absolute difference between the adjacent student is maximum.

Round 4- Skype Interview ( 1 hr) :
Q1. Write dfs iterative code for a graph.
Q2. Given a linked list print the last nth node.
Q3. Given disks and rings. You have an array representing the size of those disks. And another array having sizes of the rings.
Rules:
1. A smaller disk can pass bigger ring.
2. A disk equal to another disk will be stuck at the top of the disk.
3. If there’s a disk stuck at the top of a ring, no other disk can pass through it, it will be stuck at its top.
4. Only one more disk can be stuck at the top of the first ring.
5. If one disk is at the top, no more insertion of a disk can be done.
Write a code to find the number of disks that can be inserted. Start inserting from the first element of the array. Only one disk can be inserted above the first ring.

```Input :
4 5 6 2 1-> rings
1 1 2 3 4->disks
Explanation :4D 4R 3R 3D 2D 2R 1D 1D 1R
Output :Ans: 5

Input :
4 5 1 2 1-> rings
1 1 4 3 4->disks
Explanation :4D 4R 5R 1D 1D 1R 2R 1R
Output :Ans: 3

```

Q4. Optimise the previous solution.

Write your Interview Experience or mail it to contribute@geeksforgeeks.org

My Personal Notes arrow_drop_up

If you like GeeksforGeeks and would like to contribute, you can also write an article using contribute.geeksforgeeks.org or mail your article to contribute@geeksforgeeks.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.