Skip to content
Related Articles

Related Articles

Improve Article

OYO Rooms Interview Experience | SDE-2

  • Last Updated : 25 Nov, 2019

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.

Attention reader! Don’t stop learning now. Get hold of all the important DSA concepts with the DSA Self Paced Course at a student-friendly price and become industry ready. To complete your preparation from learning a language to DS Algo and many more, please refer Complete Interview Preparation Course. In case you are prepared, test your skills using TCS, Wipro, AmazonGoogle and Microsoft Test Serieses.

My Personal Notes arrow_drop_up
Recommended Articles
Page :