OYO Rooms Interview Experience | SDE-2

Location: Hyderabad

Round 1:

Phone call round.

  1. Maximum path sum where path starts and ends with leaf in a binary tree
  2. Max house robber problem – single array
  3. find min k elements in an array of n elements.

Round 2:

Onsite started.

  1. Print boundary of a binary tree
  2. Advantages and disadvantages of indexes in database
  3. Min number of steps taken in a grid to reach from top left to bottom right, when you have blocking walls in between

Round 3:

  1. Design restaurant management system – LLD
  2. Differences btw process and thread
  3. Min time required to rot all arranges in a m x n grid
  4. questions on CAP theorem, ACID vs BASE properties

Round 4:

  1. Design chess – LLD
  2. questions on projects done at my prev companies.

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.

Article Tags :
Practice Tags :

Be the First to upvote.

Please write to us at contribute@geeksforgeeks.org to report any issue with the above content.