Oyo Rooms Software Developer Intern Interview Questions, Process, and Tips

Round duration - 90 minutes
Round difficulty - Hard

Timing was 11 am. Platform was quite well.

• Q1. Rat in a Maze You are given a starting position for a rat which is stuck in a maze at an initial point (0, 0) (the maze can be thought of as a 2-dimensional pla...read more
  View Answers (1)
• Q2. Minimum Cost to Destination You have been given an N*M matrix where there are 'N' rows and 'M' columns filled with '0s' and '1s'...read more
  View Answers (3)

Round duration - 90 minutes
Round difficulty - Easy

• Q1. Detect Cycle in a Directed Graph Given a directed graph, check whether the graph contains a cycle or not. Your function should return true if the given graph co...read more
  View Answers (2)
• Q2. Next Permutation You have been given a permutation of ‘N’ integers. A sequence of ‘N’ integers is called a permutation if it contains all integers from 1 to ‘N...read more
  View Answers (3)

Round duration - 60 minutes
Round difficulty - Easy

• Q1. Validate BST Given a binary tree with N number of nodes, check if that input tree is BST (Binary Search Tree) or not. If yes, return true, return false otherwis...read more
  View Answers (3)

Round duration - 90 minutes
Round difficulty - Medium

The test was scheduled at 2:30 PM, IST. The test was conducted online, due to the ongoing pandemic situation. Webcam was required to be switched on during the complete duration of the test. I had solved 2/2 coding questions with all test cases successfully passing. Out of the 10 MCQ questions, I had done 6. Around 90 students sat for the online coding round, 19 were shortlisted for the interview. Those who had solved both coding questions were called for interview.

• Q1. Candies Prateek is a kindergarten teacher. He wants to give some candies to the children in his class. All the children stand in a line and each of them has a g...read more
  View Answers (3)
• Q2. Min cost to reach N Ninja Yuki is in the mood of shopping ninja blades today, and why should he not be, its finally the time for the Spring Fair in his Village....read more
  View Answers (4)

Round duration - 60 minutes
Round difficulty - Medium

This was a pure DSA based round. Two questions were asked in this round. The interviewer was quite good, and helped in between.

• Q1. First Unique Character in a String You are given a string A consisting of lower case English letters. You have to find the first non-repeating character from ea...read more
  View Answers (4)
• Q2. Boolean Matrix Given a 2-dimensional boolean matrix mat of size N x M, modify the matrix such that if an element is 1, set its entire row and column to 1 i.e. i...read more
  View Answers (3)

Round duration - 75 minutes
Round difficulty - Medium

This round was also again focused on DSA. Two interviewers were present. This round was very extensive and everything was asked in depth as well as they asked to write the codes as well for all the questions. I was also asked to explain my projects, they were based on ML. Many aspects of OOPs, POP, memory allocation was asked as well.

• Q1. Maximum sum of (i*Arr[i]) among all possible rotations of an array. You are given an array 'ARR' consisting of 'N' elements, and you need to fin...read more
  View Answers (3)
• Q2. Averages of Levels in Binary Tree You are given an arbitrary binary tree consisting of 'N' nodes numbered from 1 to 'N', and each node is associ...read more
  View Answers (2)

Round duration - 60 minutes
Round difficulty - Medium

• Q1. Longest Increasing Subsequence For a given array with N elements, you need to find the length of the longest subsequence from the array such that all the elemen...read more
  View Answers (5)
• Q2. Digits Decoding A few days back, Ninja encountered a string containing characters from ‘A’ to ‘Z’ which indicated a secret message. For security purposes he enc...read more
  View Answers (5)

Round duration - 60 minutes
Round difficulty - Medium

• Q1. Leaves at same level Bob has been given a binary tree having N nodes. He has been asked to check if all the leaf nodes are at the same level. Your task is to he...read more
  View Answers (2)
• Q2. Maximum sum of non-adjacent elements You are given an array/list of ‘N’ integers. You are supposed to return the maximum sum of the subsequence with the constra...read more
  View Answers (4)

Round duration - 60 minutes
Round difficulty - Medium

• Q1. LRU Cache Implementation Design and implement a data structure for Least Recently Used (LRU) cache to support the following operations: 1. get(key) - Return the...read more
  View Answers (3)
• Q2. Doors Puzzle There are 100 doors in a row, all doors are initially closed. A person walks through all doors multiple times and toggle (if open then close, if cl...read more
  View Answers (1)
• Q3. Operating System

  Tell the difference between Mutex and semaphores.

  View Answers (1)
• Q4. DBMS

  What is Indexing, why it is done and explain all the types of Indexing?

  View Answers (1)
• Q5. DBMS

  Given employee and dept table find the no of employees in each dept(Question on Joins).

  View Answers (1)
• Q6. OOPS Questions

  Difference between function overloading and function overriding with example. And also about runtime and compile time binding while overriding.

  Add Answer