OYO Rooms Interview Experince for SDE | On-Campus

Oyo Rooms visited our college for recruitment by October 2019. CS, IT, ETCE, EE & IEE students  attended the online round.

Round 1:

It was an online coding round on InterviewBit platform. There were 2 coding problems and 20 mcqs ( DBMS, OS, Computer Networks).

  1. Given a binary array a[], we need to find length of the longest subarray of ‘1’s possible by swap at most 1 time.
  2. Count no of ways to reach nth stair by using 1th, 2th, 3th stair. But 3th stair can be used at most b times.

16 students were shortlisted first and then 15 more were shortlisted after a retest.

Round 2: 



It was a F2F interview round.

She first asked me to introduce myself and to explain my project. Then she moved on data structure and algorithms. First question was- https://www.geeksforgeeks.org/detect-and-remove-loop-in-a-linked-list/

Second question was- https://codeforces.com/problemset/problem/405/A

Nearly 13 students qualified this round out of 31.

Round 3:

It was again a F2F technical Interview round.

He first asked me to introduce and then he started asking  me questions on OS like- what is process and thread, scheduling algos, memory management, what is cache, how it works and then he moved to different eviction policies of pages from cache. Then he asked me to implement LRU cache(https://www.geeksforgeeks.org/lru-cache-implementation/).

Next question-  https://www.geeksforgeeks.org/median-of-stream-of-integers-running-integers/

At the end of this round, the result was declared and a total of 9 students were selected including me. Hope my experience helps.

 

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.