# OYO Rooms SDE-1 Experience (On-Campus)

• Difficulty Level : Medium
• Last Updated : 05 Sep, 2018

Online round

Consisted of 2 coding questions and 20 MCQ’S:

First question:

Given a source and destination in a NxN maze find the shortest path between them, some of the cells are occupied and one cannot find path through them.

https://practice.geeksforgeeks.org/problems/shortest-source-to-destination-path/0

Second question was:

Given d,  a,  b and an array of integers. You can add/subtract a and b to d any number of times. You have to find the count of array elements which can be formed by applying these operations to d.

I solved 1st question using bfs approach and completed MCQ’s .31 students got selected for first round out of around 150.

F2F Round 1:( around 105 mins)  The interviewer asked me to tell about myself and then he started things from my resume. Since I have a developer kind of profile and some good previous internship experience, he started with projects involved during my internships, their design patterns also asked to write approach involved in them. So with all this after around 45 minutes, he took around 2-3 min break, also offered me some cookies. I thought interview got over but then he shifted towards data structure and algorithms.He asked 3 problems :

Problem 3: https://www.geeksforgeeks.org/find-the-element-that-appears-once-in-a-sorted-array/   (O(logn) approach)

I solved all the three problems and he asked me to write code for each on paper. For second question he also asked me to draw a heapfied tree for each iteration as it involves heaps and then asked basic questions on heap. In the third question, I got confused but I discussed the approach with the interviewer and then finally after taking some time solved it.

So this was my first round, basic advice is that for every question take your time and try to discuss possible approaches with your interviewer and try to make it interactive on both side.

21 students were selected for the second round.