OYO Rooms Interview Experience | SDE-2 Improve Improve Like Article Like Save Share Report Location: Hyderabad Round 1: 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. Round 2: Onsite started. 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 Round 3: 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 Round 4: Design chess – LLD questions on projects done at my prev companies. Last Updated : 25 Nov, 2019 Like Article Save Article Previous OYO Interview Experience for SDE-1 (On-Campus) Next Amazon Interview Experience for SDE-2 Share your thoughts in the comments Add Your Comment Please Login to comment...