OYO Rooms Interview Experience | Set 3 (For SDE-II, Gurgaon)

Round 0: I was given two problems to solve on paper (I wrote this as zero because it was not elimination round)

  1. Given a linked list N1 -> N2 -> N3 -> N4 …… -> Nk, you have to convert this to N1 -> Nk -> N2 -> Nk-1 …. and so on.
    GeeksforGeeks Link
  2. Given a cost matrix, you have to find the minimum cost to travel from station 0 to station n-1. (you can only travel in ascending direction)
    i.e you have to travel from station 0 to station 3 and values of the matrix are cost like station 0 t0 2 in the first-row cost would be 78

    stations 0 1 2 3
    0 0 26 78 90
    1 Infinite 0 34 60
    2 Infinite Infinite 0 65
    3 Infinite Infinite Infinite 0

Round 1: Started with the introduction and then moved to following questions.

  1. In this round, I have been asked to articulate my approach to round 0 questions and some optimization question (i.e how would you reduce iteration in the first question).
  2. Deceberry number

Round 2:

  1. It started with my current project and it’s functionality.
  2. Design OYO pricing system with following Constraints Place, Hotel Stars, Dates, Room type etc. and many counter questions were asked.
  3. Word Ladder

Round 3:

  1. Design OYO Notification system (Generic). The question was purely vague, I had to discuss with the interviewer with my own pros and cons and proceed.
  2. How to check a Binary Tree is BST or not.

Round 4: Hiring Manager Round.

  1. Discussion around my current project.
  2. Discussion about my Difficult situations, and how did I tackle one.
  3. Discussion around what I did apart from my job for the current company.
  4. Design a Snake and Ladder game. (just main classes will do), further question how would you track snake and ladder.
  5. Write test cases around it.


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.