OYO Interview Experience for SDE

Oyo Rooms visited our college for recruitment by September 2019. CSE, EE and ME students above CGPA 6.0 attended the online round.

Round 1: Online Round

Online test was conducted on Interviewbit platform. The test consists of 2 coding questions and 20 MCQ(networks, OS, DBMS, OOPS, Java).

Each MCQ is of 2 marks. One coding question is of 50 marks and another one is of 100 marks. There is no negative for the incorrect answer of MCQ.

The students who able to solve atleast one coding question were selected for the next round.

Around 25 students were shortlisted for interview.

Round 2: Technical F2F Interview

This interview is mainly to test your coding skills and data structure. Three questions were asked in this round.

  1. https://www.geeksforgeeks.org/connect-nodes-at-same-level/
  2. https://www.geeksforgeeks.org/print-elements-sorted-order-row-column-wise-sorted-matrix/
  3. Asked to write code for max-heapify.

Round 3: Technical F2F Interview

This interview is for testing your concepts of OS and Dbms as well as your coding skills.

First, the interviewer asked me some Dbms questions.

  1. What is normalisation?
  2. Asked to write 2 SQL query.

Then he moves on to OS questions

  1. Difference between process and thread.
  2. Virtual memory

Then he moves to coding questions

  1. Implement LRU Cache without using the queue data structure. He was expecting a solution using Linked-list.
  2. Given a linked list of size n where any node can contain 0, 1 or 2. You have to sort the given linked list. You can’t modify the value of any node. Expected Time Complexity – O(n).


Some of the students had one more interview round.

Finally, 5 of us were given an offer.


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 :


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