OYO Interview Experience | Set 11 (For 2 years experienced)

Round 1: Skype
Questions mostly on the technology you have worked on and algorithms.

Algo: Find pair in BST which sums to X.

Round 2-5 (in person)

Round 2:
1. Implement stack using queue.

2. Left view of Binary Tree

And few Java concepts questions.

Round 3:

1. Problem statement: Given a log file with sessionID, source pageId, destn pageID and Timestamp at which the page is visited. Identify all the pages that are linked and find the minimum count of the page to visit to reach P2 from P1 – Use Graph and apply BFS.

2. Design Tank Game – Identify all the classes, member variable, methods and relationship between each class. A design pattern can be applied.
Ref: https://www.youtube.com/watch?v=K6VBLJ4AR2Q

Round 4:
1. Determine if there is a subset of the given set with sum equal to given sum

2. Implement LRU cache.

Questions on java concepts, design pattern and multithreading.

Round 5 (Hiring Manager):
Questions were mainly from resume, behavioral questions, design, and databases concept(join, query)

Note: You have to write the code on paper in each round.

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 write comments if you find anything incorrect, or you want to share more information about the topic discussed above.

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



My Personal Notes arrow_drop_up