OYO Interview Experience – SDE 2

Round 1:
This was a written round. 2 questions were asked.

1. Sum of digits is given and count of digits is given, we need to return number of such numbers possible.
For e.g, if sum is 4 and count is 2, then numbers possible are: 13, 22, 31, 40
so output is 4


2. A BST is given and a number K is given. We need to return kth smallest element from BST.

Whoever solved 1 question was called for face to face interviews.

Round 2:
This was a face to face interview.

1. First discussion about written round questions. I had solved both questions so I was asked to provide optimizations for ist question.
I had coded iterative approach, so first I optimized it then I explained how question could be solved using recursion and DP.

2. A BST is given, in which 2 nodes are swapped. We need to return original BST. He wanted code for this. Normal recursive solution was accepted.

Round 3:

1. Discussion about previous projects.
2. What is database Indexing and how is it implemented?
3. How to threads communicate as in pass messages in a multi threaded environment?
4. https://www.geeksforgeeks.org/minimum-time-required-so-that-all-oranges-become-rotten/
5. https://www.geeksforgeeks.org/search-an-element-in-a-sorted-and-pivoted-array/
Round 4:
1. What is mutex and semaphore?
2. What is database indexing?
3. https://www.geeksforgeeks.org/diameter-of-a-binary-tree/
4. https://www.geeksforgeeks.org/minimum-steps-reach-target-knight/

Round 5:
Leadership Round:

1. Many behavioural questions like why Oyo, any conflict with manager, and conflict with peer etc
2. Discusiion on pro and cons of uber pool

The entire process lasted for almost 7 hrs. After last round HR said he will contact me after 2 days but he only gave out the results after 10 days.

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

My Personal Notes arrow_drop_up

Check out this Author's contributed articles.

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.