Skip to content
Related Articles

Related Articles

OYO Rooms Interview Experience for FTE (On-Campus)
  • Last Updated : 25 Dec, 2020

Oyo visits our campus on 18 December 2020 for full-time developers. There was a total of 3 rounds including the online test.

Round 1: This was an online Round that includes 10 MCQ questions each of 2 marks, 2 coding questions out of which one contains 75 marks and the other content 100 marks. The coding question was like

  1. You will have two arrays a[], b[] of the size of given no of the employee. Where a[i] denotes the capacity of employee i and b[i] denotes the index of his manager.

    Suppose for any employee with index 2 a[2] denotes the capacity of an employee and b[2] denotes the index of his manager and a[b[2]] denotes the capacity of his manager.

    Condition is given that no employee will have more capacity than his manager. So basically reduce employee capacity.



    You have to find the sum of the capacity of all employees.

    I am not clear about the question but it was something like that.

  2. The second was a bit of a visualization-based problem. ‘n’ points are given which are diagonally opposite to the point (1, 1) making rectangles with sides parallel to the axes. Also, there are ‘r’ buildings whose coordinates (xi, yi) along with their heights (hi). We have to find out the maximum height among all buildings that are inside a rectangle.

For the first question, I got 60 out of 75, and from the second question I tried brute force and I get 40 out of 100.

Only 15 students got selected for the interview round, and I was one of them.

Round 2 for 70 min: The ask only two coding question.

  1. You will be given an array and window size. You have to take all subarray of given window size and find out the minimum of that window size and among all minimums, you have to find the maximum. I used the sliding window concept for this problem.

  2. Print Nodes in Top View of Binary Tree



I have to first implement the logic then share my screen and do the code and finally, I have to dry the code for the input interviewer will give.

I think only 5 out of 15 got selected. I was one of them.

Round 3 for 60 min: Again they as two coding question

  1. ZigZag Tree Traversal.
  2. Maximum size square sub-matrix with all 1s.

In this round, I don’t have to understand the logic I was told to write the code directly, after the interview, asked a to z thing in this code including that how this code is finding the answer.

Luckily I have done both codes, so I gave 100% correct answers and optimize the solution. After that, he asked about my project nothing much but when I told him that I have used MongoDB then he starts giving me a hypothetical situation where I have to implement traditional RDBMS without using MongoDB.

  1. Asked me Inheritance indirectly.
  2. What is polymorphism?
  3. What is a virtual keyword?
  4. Explain for example runtime polymorphism.
  5. Indexing in SQL and data structure used in indexing.

Only 2 students got the final selection, and I was lucky enough to get the job. Do the interview experience from Gfg they almost asked the same question, and your luck also matter, one of my friends was asked to implement Floyd warshell alog, np-hard problem, MO’s algo.

So do experience code first that will help alot

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 and Microsoft Test Serieses.

My Personal Notes arrow_drop_up
Recommended Articles
Page :