OYO Rooms Interview Experience | SDE-2
Phone call round.
- Maximum path sum where path starts and ends with leaf in a binary tree
- Max house robber problem – single array
- find min k elements in an array of n elements.
- Print boundary of a binary tree
- Advantages and disadvantages of indexes in database
- Min number of steps taken in a grid to reach from top left to bottom right, when you have blocking walls in between
- Design restaurant management system – LLD
- Differences btw process and thread
- Min time required to rot all arranges in a m x n grid
- questions on CAP theorem, ACID vs BASE properties
- Design chess – LLD
- 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, Amazon. Google and Microsoft Test Serieses.