Upload Button Icon Add office photos
Engaged Employer

i

This company page is being actively managed by Oyo Rooms Team. If you also belong to the team, you can get access from here

Oyo Rooms Verified Tick

Compare button icon Compare button icon Compare

Filter interviews by

Oyo Rooms Software Developer Interview Questions, Process, and Tips

Updated 11 Sep 2024

Top Oyo Rooms Software Developer Interview Questions and Answers

  • Q1. Water Jug Problem Statement You have two water jugs with capacities X and Y liters respectively, both initially empty. You also have an infinite water supply. The goal i ...read more
  • Q2. Minimum Cost to Destination You are given an NxM matrix consisting of '0's and '1's. A '1' signifies that the cell is accessible, whereas a '0' indicates that the cell i ...read more
  • Q3. Zig-Zag String Problem Statement Given a string 'STR' of length 'N' and an integer 'M' representing the number of rows in the zig-zag pattern, your task is to return the ...read more
View all 24 questions

Oyo Rooms Software Developer Interview Experiences

12 interviews found

Interview experience
4
Good
Difficulty level
Moderate
Process Duration
Less than 2 weeks
Result
Not Selected

I applied via Approached by Company and was interviewed in Aug 2024. There were 2 interview rounds.

Round 1 - Coding Test 

DSA , medium n easy leetcode question was there

Round 2 - One-on-one 

(2 Questions)

  • Q1. Low level design
  • Q2. DSA and computer fundamental
Interview experience
4
Good
Difficulty level
-
Process Duration
-
Result
-
Round 1 - Technical 

(1 Question)

  • Q1. Merge sort algorithm and divide array in the chunks
  • Ans. 

    Merge sort is a sorting algorithm that divides an array into smaller chunks and then merges them in sorted order.

    • Merge sort is a divide-and-conquer algorithm.

    • It recursively divides the array into two halves until each subarray has only one element.

    • Then it merges the subarrays in sorted order.

    • The merge step compares elements from both subarrays and places them in the correct order.

    • It has a time complexity of O(n log n).

  • Answered by AI

Skills evaluated in this interview

Software Developer Interview Questions Asked at Other Companies

asked in Amazon
Q1. Maximum Subarray Sum Problem Statement Given an array of integers ... read more
asked in Amazon
Q2. Minimum Number of Platforms Needed Problem Statement You are give ... read more
asked in Rakuten
Q3. Merge Two Sorted Arrays Problem Statement Given two sorted intege ... read more
asked in Cognizant
Q4. Nth Fibonacci Number Problem Statement Calculate the Nth term in ... read more
Q5. Find Duplicate in Array Problem Statement You are provided with a ... read more
Interview experience
5
Excellent
Difficulty level
Moderate
Process Duration
2-4 weeks
Result
Selected Selected

I applied via Campus Placement and was interviewed in Apr 2023. There were 4 interview rounds.

Round 1 - Resume Shortlist 
Pro Tip by AmbitionBox:
Don’t add your photo or details such as gender, age, and address in your resume. These details do not add any value.
View all tips
Round 2 - Coding Test 

Coding Questions and SQL

Round 3 - Technical 

(1 Question)

  • Q1. Topics : Trees and LinkedList
Round 4 - Technical 

(1 Question)

  • Q1. Trees, LinkedList and SQL queries

Software Developer Interview Questions & Answers

user image Ashutosh Gupta

posted on 4 May 2023

Interview experience
5
Excellent
Difficulty level
-
Process Duration
-
Result
Selected Selected
Round 1 - Resume Shortlist 
Pro Tip by AmbitionBox:
Double-check your resume for any spelling mistakes. The recruiter may consider spelling mistakes as careless behavior or poor communication skills.
View all tips
Round 2 - Coding Test 

3 coding questions and platform was hackerrank

Round 3 - One-on-one 

(1 Question)

  • Q1. Two medium graph questions from leetcode

Oyo Rooms interview questions for designations

 Software Developer Intern

 (4)

 Software Engineer

 (7)

 Software Development Engineer

 (1)

 Software Engineer III

 (1)

 Senior Web Developer

 (1)

 Senior Android Developer

 (1)

 Frontend Developer Intern

 (1)

 Software Development Engineer Intern

 (2)

Interview experience
5
Excellent
Difficulty level
-
Process Duration
-
Result
-
Round 1 - Resume Shortlist 
Pro Tip by AmbitionBox:
Properly align and format text in your resume. A recruiter will have to spend more time reading poorly aligned text, leading to high chances of rejection.
View all tips
Round 2 - Coding Test 

3 coding questions and platform was hackerrank

Round 3 - One-on-one 

(1 Question)

  • Q1. Some medium Graph problems from leetcode

Get interview-ready with Top Oyo Rooms Interview Questions

Round 1 - Resume Shortlist 
Pro Tip by AmbitionBox:
Keep your resume crisp and to the point. A recruiter looks at your resume for an average of 6 seconds, make sure to leave the best impression.
View all tips
Round 2 - Technical 

(1 Question)

  • Q1. Dictionary Sort , DFS, BFS
Round 3 - Technical 

(1 Question)

  • Q1. Reverse a LinkedList from m to n
  • Ans. 

    Reverse a LinkedList from m to n

    • Traverse the list to m-1th node

    • Reverse the nodes from m to n

    • Connect the reversed list to the original list

  • Answered by AI

Interview Preparation Tips

Interview preparation tips for other job seekers - Prepare DSA as the rounds are only technical. No projects were asked

Skills evaluated in this interview

I was interviewed in Jan 2021.

Round 1 - Coding Test 

(2 Questions)

Round duration - 90 Minutes
Round difficulty - Easy

This round was conducted on the HackerEarth platform. It had 2 sections and candidates were given a time of 1 hour 30 minutes. 

Programming MCQs — 18 MCQs (each of 2 marks)
Questions were a little tricky. it tested upon one’s programming fundamentals. It had C/C++ output questions, pseudocode questions, Operating systems, and SQL queries.
Coding — 2 ( one contains 75 marks and the other contains 100 marks )

Our scores of the first 2 sections weren’t revealed. My MCQs went really well. I solved 2 coding questions in the coding section. Only 15 students got selected for the interview round, and I was one of them.

  • Q1. 

    Count Ways to Complete Journey in Triangular Pyramid

    Given a triangular pyramid with vertices marked as ‘O’, ‘X’, ‘Y’, and ‘Z’, and an integer 'N', you need to calculate the number of ways Bob can start a...

  • Ans. 

    Calculate the number of ways to complete a journey in a triangular pyramid starting and ending at a specific vertex after taking a certain number of steps.

    • Use dynamic programming to calculate the number of ways to return to the starting vertex after 'N' steps.

    • Consider the possible movements from each vertex to adjacent vertices.

    • Keep track of the number of ways to reach each vertex after each step.

    • Return the total numbe...

  • Answered by AI
  • Q2. 

    Maximum Profit Problem Statement

    Mukesh is evaluating the maximum profit from his business over a series of days. Given a list of profits over 'N' days, Mukesh wants to determine the highest profit achiev...

  • Ans. 

    The task is to find the maximum profit achievable over any consecutive days within a specified range {‘A’, ‘B’}.

    • Iterate through the profit array and calculate the cumulative sum for each possible consecutive days within the range {‘A’, ‘B’}.

    • Keep track of the maximum profit obtained during the iteration.

    • Return the maximum profit as the final result.

  • Answered by AI
Round 2 - Video Call 

(3 Questions)

Round duration - 60 Minutes
Round difficulty - Medium

This round was scheduled for 1 hour and the panel had 1 interviewer. Being a virtual interview, the first challenge that I faced was that the interviewer was not audible. I suggest you not panic in such a situation and use the chatbox feature (or contact HR if need be) to figure out something that works for you and the panel. We later connected over voice call (over the phone) with our videos ON (over a laptop) and continued with the interview.

The interview was very calm and helpful. I was able to solve all questions and I explained different approaches to solve the questions. Once he was convinced of my solution, he asked me to write the code on my own IDE.

  • Q1. 

    Running Median Problem

    Given a stream of integers, calculate and print the median after each new integer is added to the stream.

    Output only the integer part of the median.

    Example:

    Input:
    N = 5  
    Stre...
  • Ans. 

    Calculate and print the median after each new integer is added to the stream.

    • Use a min heap to store the larger half of the numbers and a max heap to store the smaller half

    • Keep the sizes of the two heaps balanced to efficiently calculate the median

    • If the total number of elements is odd, the median will be the top element of the max heap

    • If the total number of elements is even, the median will be the average of the top e

  • Answered by AI
  • Q2. 

    Boundary Traversal of a Binary Tree

    Given a binary tree of integers, your task is to return the boundary nodes of the tree in Anti-Clockwise direction starting from the root node.

    Input:

    The first line ...
  • Ans. 

    Return the boundary nodes of a binary tree in Anti-Clockwise direction starting from the root node.

    • Traverse the left boundary nodes in a top-down manner

    • Traverse the leaf nodes from left to right

    • Traverse the right boundary nodes in a bottom-up manner

    • Handle cases where duplicates occur in the boundary nodes

    • Implement the function without printing as printing is already managed

  • Answered by AI
  • Q3. 

    Count Pairs with Given Sum

    Given an integer array/list arr and an integer 'Sum', determine the total number of unique pairs in the array whose elements sum up to the given 'Sum'.

    Input:

    The first line c...
  • Ans. 

    Count the total number of unique pairs in an array whose elements sum up to a given value.

    • Use a hashmap to store the frequency of each element in the array.

    • Iterate through the array and for each element, check if (Sum - current element) exists in the hashmap.

    • Increment the count of pairs if the complement exists in the hashmap.

  • Answered by AI
Round 3 - Video Call 

(2 Questions)

Round duration - 90 Minutes
Round difficulty - Medium

This was a technical + HR round. First, he asked me to introduce myself. This round was also based on your knowledge of DSA. I was asked 2 coding questions. Then he asked a couple of questions from OS and DBMS which were pretty easy. At last, we ended the interview on a good note. Then he asked me questions about myself.
Why I want to join OYO rooms. 
What are my hobbies?
Goals in the next five years.

  • Q1. 

    Zig-Zag String Problem Statement

    Given a string 'STR' of length 'N' and an integer 'M' representing the number of rows in the zig-zag pattern, your task is to return the string formed by concatenating all...

  • Ans. 

    Given a string and number of rows, return the concatenated string formed by arranging the input string in a zig-zag pattern over the specified number of rows.

    • Iterate through the string and distribute characters in zig-zag pattern over 'M' rows

    • Keep track of the direction of movement (up or down) while distributing characters

    • Concatenate characters row-wise to get the final zig-zag pattern string

  • Answered by AI
  • Q2. 

    Ways To Make Coin Change

    Given an infinite supply of coins of varying denominations, determine the total number of ways to make change for a specified value using these coins. If it's not possible to make...

  • Ans. 

    The task is to find the total number of ways to make change for a specified value using given denominations.

    • Use dynamic programming to solve this problem efficiently.

    • Create a 2D array to store the number of ways to make change for each value using different denominations.

    • Iterate through the denominations and update the array accordingly.

    • The final answer will be stored in the last cell of the array.

    • Consider edge cases l

  • Answered by AI

Interview Preparation Tips

Eligibility criteriaNo CriteriaOYO interview preparation:Topics to prepare for the interview - Data Structures, Computer Networking, C++, OOPS, System Design, Algorithms, Dynamic ProgrammingTime required to prepare for the interview - 12 MonthsInterview preparation tips for other job seekers

Tip 1 : Practice coding questions as much as you can.
Tip 2 : Your communication skills must be good.
 

Application resume tips for other job seekers

Tip 1 : Mention some good projects on your resume.
Tip 2 : Don't write any false information on your resume.

Final outcome of the interviewSelected

Skills evaluated in this interview

Interview experience
3
Average
Difficulty level
Moderate
Process Duration
Less than 2 weeks
Result
Selected Selected

I applied via LinkedIn and was interviewed before Aug 2022. There were 3 interview rounds.

Round 1 - Resume Shortlist 
Pro Tip by AmbitionBox:
Do not use an unprofessional email address such as cool_boy@email.com. It shows a lack of professionalism by the candidate.
View all tips
Round 2 - Technical 

(1 Question)

  • Q1. Operating system questions
Round 3 - Coding Test 

Linked list standard questions

I was interviewed in Jan 2021.

Round 1 - Coding Test 

(2 Questions)

Round duration - 90 Minutes
Round difficulty - Hard

Timing was 11 am. Platform was quite well.

  • Q1. 

    Rat in a Maze Problem Statement

    You need to determine all possible paths for a rat starting at position (0, 0) in a square maze to reach its destination at (N-1, N-1). The maze is represented as an N*N ma...

  • Ans. 

    Find all possible paths for a rat in a maze from source to destination.

    • Use backtracking to explore all possible paths in the maze.

    • Keep track of visited cells to avoid revisiting them.

    • Explore all possible directions (up, down, left, right) from each cell.

    • Add the current direction to the path and recursively explore further.

    • When reaching the destination, add the path to the list of valid paths.

  • Answered by AI
  • Q2. 

    Minimum Cost to Destination

    You are given an NxM matrix consisting of '0's and '1's. A '1' signifies that the cell is accessible, whereas a '0' indicates that the cell is blocked. Your task is to compute ...

  • Ans. 

    Find the minimum cost to reach a destination in a matrix with blocked cells.

    • Use Breadth First Search (BFS) algorithm to explore all possible paths from the starting point to the destination.

    • Keep track of the cost incurred at each cell and update it as you move through the matrix.

    • Return the minimum cost to reach the destination or -1 if it is unreachable.

    • Consider edge cases such as when the starting point is the destina

  • Answered by AI

Interview Preparation Tips

Professional and academic backgroundI completed Computer Science Engineering from Chitkara University. Eligibility criteria6.5 CGPAOYO interview preparation:Topics to prepare for the interview - Data Structure, OS, DBMS, Java, Problem Solving, OOPSTime required to prepare for the interview - 1 MonthInterview preparation tips for other job seekers

Tip 1 : Practice data structure based questions.
Tip 2 : OOPS is very important.
Tip 3 : Prepare OS and DBMS for mcq.

Application resume tips for other job seekers

Tip 1 : Mention atleast 2 projects on resume.
Tip 2 : Keep it short in length.

Final outcome of the interviewRejected

Skills evaluated in this interview

I was interviewed before May 2021.

Round 1 - Coding Test 

(1 Question)

Round duration - 90 Minutes
Round difficulty - Easy

  • Q1. 

    Position of Right Most Set Bit

    Determine the position of the rightmost set bit in the binary representation of a given number N.

    Input:

    T: Number of test cases
    N: An integer for which the position of the...
  • Ans. 

    Find the position of the rightmost set bit in a given number's binary representation.

    • Convert the number to binary representation.

    • Find the position of the rightmost set bit by counting from right to left.

    • Return the position of the rightmost set bit.

  • Answered by AI
Round 2 - Coding Test 

(1 Question)

Round duration - 60 Minutes
Round difficulty - Medium

  • Q1. 

    Water Jug Problem Statement

    You have two water jugs with capacities X and Y liters respectively, both initially empty. You also have an infinite water supply. The goal is to determine if it is possible to...

  • Ans. 

    The Water Jug Problem involves determining if a specific amount of water can be measured using two jugs of different capacities.

    • Start by considering the constraints and limitations of the problem.

    • Think about how the operations allowed can be used to reach the target measurement.

    • Consider different scenarios and test cases to understand the problem better.

    • Implement a function that can determine if the target measurement

  • Answered by AI
Round 3 - Video Call 

Round duration - 60 Minutes
Round difficulty - Medium

Interview Preparation Tips

Eligibility criteriaAbove 7.5 CGPAOYO interview preparation:Topics to prepare for the interview - Data Structures and Algorithm, Machine Learning, DBMS, C++, Python, Front End Web DevelopmentTime required to prepare for the interview - 1 YearInterview preparation tips for other job seekers

Tip 1 : Make your DSA and Algorithm as much as strong as possible.Main focus should be on Graphs and Trees.
Tip 2 : There are many standard algorithm on which questions are frequently asked.Try to practice as much as you can on them.
Tip 3 : Your project should be unique to create unforgettable impression.

Application resume tips for other job seekers

Tip 1 : Add 2-3 best of your projects which shows something extraordinary.
Tip 2 : Add your achievements if you have any like getting top rank in a coding competition.

Final outcome of the interviewSelected

Skills evaluated in this interview

Oyo Rooms Interview FAQs

How many rounds are there in Oyo Rooms Software Developer interview?
Oyo Rooms interview process usually has 2-3 rounds. The most common rounds in the Oyo Rooms interview process are Technical, Resume Shortlist and Coding Test.
What are the top questions asked in Oyo Rooms Software Developer interview?

Some of the top questions asked at the Oyo Rooms Software Developer interview -

  1. merge sort algorithm and divide array in the chu...read more
  2. Reverse a LinkedList from m t...read more
  3. two medium graph questions from leetc...read more

Tell us how to improve this page.

Oyo Rooms Software Developer Interview Process

based on 7 interviews

2 Interview rounds

  • Coding Test Round - 1
  • Coding Test Round - 2
View more
Oyo Rooms Software Developer Salary
based on 197 salaries
₹5.9 L/yr - ₹24.6 L/yr
80% more than the average Software Developer Salary in India
View more details

Oyo Rooms Software Developer Reviews and Ratings

based on 21 reviews

3.1/5

Rating in categories

3.8

Skill development

2.9

Work-life balance

3.3

Salary

2.6

Job security

2.9

Company culture

3.1

Promotions

3.2

Work satisfaction

Explore 21 Reviews and Ratings
Business Development Manager
1.7k salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Demand Manager
845 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Hotel Manager
503 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Key Account Manager
482 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Guest Relation Executive
402 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Explore more salaries
Compare Oyo Rooms with

MakeMyTrip

3.7
Compare

Yatra

3.4
Compare

Treebo Hotels

3.3
Compare

FabHotels

3.0
Compare
Did you find this page helpful?
Yes No
write
Share an Interview