AmbitionBox
Interview Questions
- Reviews
- Salaries
- Interview Questions
- About Company
- Benefits
- Jobs
- Office Photos
- Community
Add office photos
i
Oyo
Rooms
Compare
Filter interviews by
Oyo Rooms Software Developer Interview Questions and Answers for Freshers
10 Interview questions
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 mat...
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.
Sum Tree Conversion
Convert a given binary tree into its sum tree. In a sum tree, every node's value is replaced with the sum of its immediate children's values. Leaf nodes are set to 0. Finally, return the...
Convert a binary tree into a sum tree by replacing each node's value with the sum of its children's values. Return preorder traversal.
Traverse the tree in a bottom-up manner, starting from the leaf nodes.
For each node, update its value to the sum of its children's values.
Set leaf nodes to 0.
Return the preorder traversal of the modified tree.
Core concepts of indexing in DBMS include types of indexes, benefits of indexing, and factors affecting index performance.
Types of indexes: B-tree, Hash, Bitmap, etc.
Benefits of indexing: Faster data retrieval, improved query performance, reduced disk I/O.
Factors affecting index performance: Selectivity, clustering factor, index fragmentation.
Examples: Creating an index on a column in a table to speed up search qu...
Maximum Sum of Non-Adjacent Elements
You are given an array/list of integers. The task is to return the maximum sum of a subsequence such that no two elements in the subsequence are adjacent in the given a...
Find the maximum sum of non-adjacent elements in an array.
Use dynamic programming to keep track of the maximum sum at each index, considering whether to include the current element or not.
At each index, the maximum sum can be either the sum excluding the current element or the sum including the current element but excluding the previous element.
Iterate through the array and update the maximum sum accordingly.
Examp...
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 c...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
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 co...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.
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 achieva...
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.
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 at...
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 ...
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 ...
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
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
Strea...
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 ...
Oyo Rooms Software Developer Interview Experiences for Freshers
3 interviews found
Anonymous
I appeared for an interview in Jan 2021.
(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...
- 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.
(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... - 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
- Q3.
Count Pairs with Given Sum
Given an integer array/list
arrand 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.
(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
- 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...
Interview Preparation Tips
Tip 1 : Practice coding questions as much as you can.
Tip 2 : Your communication skills must be good.
Tip 1 : Mention some good projects on your resume.
Tip 2 : Don't write any false information on your resume.
Skills evaluated in this interview
I appeared for an interview in Jan 2021.
(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...
- 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 ...
Interview Preparation Tips
Tip 1 : Practice data structure based questions.
Tip 2 : OOPS is very important.
Tip 3 : Prepare OS and DBMS for mcq.
Tip 1 : Mention atleast 2 projects on resume.
Tip 2 : Keep it short in length.
Skills evaluated in this interview
I appeared for an interview before Sep 2020.
(1 Question)
Round duration - 90 minutes
Round difficulty - Medium
Coding question of medium level difficulty, from DP.
18 MCQs were core CSE related concepts e.g: OS, OOPs, DBMS, Networking
Time was 90 minutes.
- Q1.
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 ...
(2 Questions)
Round duration - 30 minutes
Round difficulty - Medium
It was an one-to-one interview. It checks your problem solving ability and a few OOPs, OS, DBMS etc concepts. Coding questions were related to array, queue and DP.
- Q1.
Triangle Formation Using Array Elements
Given an integer array/list
ARRof length 'N', determine if it is possible to form at least one non-degenerate triangle using the values of the array as the sides o... - Ans.
Determine if it is possible to form a non-degenerate triangle using array elements as sides.
Check if the sum of any two sides is greater than the third side for all combinations of sides.
If the above condition is met for any combination, return true; otherwise, return false.
- Q2.
Maximum Sum of Non-Adjacent Elements
You are given an array/list of integers. The task is to return the maximum sum of a subsequence such that no two elements in the subsequence are adjacent in the given ...
- Ans.
Find the maximum sum of non-adjacent elements in an array.
Use dynamic programming to keep track of the maximum sum at each index, considering whether to include the current element or not.
At each index, the maximum sum can be either the sum excluding the current element or the sum including the current element but excluding the previous element.
Iterate through the array and update the maximum sum accordingly.
Example: F...
(2 Questions)
Round duration - 45 minutes
Round difficulty - Easy
It was also a problem solving round. However after coding questions, they also asked CSE conceptual questions.
- Q1.
Sum Tree Conversion
Convert a given binary tree into its sum tree. In a sum tree, every node's value is replaced with the sum of its immediate children's values. Leaf nodes are set to 0. Finally, return th...
- Ans.
Convert a binary tree into a sum tree by replacing each node's value with the sum of its children's values. Return preorder traversal.
Traverse the tree in a bottom-up manner, starting from the leaf nodes.
For each node, update its value to the sum of its children's values.
Set leaf nodes to 0.
Return the preorder traversal of the modified tree.
- Q2. What are the core concepts of indexing in Database Management Systems (DBMS)?
- Ans.
Core concepts of indexing in DBMS include types of indexes, benefits of indexing, and factors affecting index performance.
Types of indexes: B-tree, Hash, Bitmap, etc.
Benefits of indexing: Faster data retrieval, improved query performance, reduced disk I/O.
Factors affecting index performance: Selectivity, clustering factor, index fragmentation.
Examples: Creating an index on a column in a table to speed up search queries...
Interview Preparation Tips
Tip 1 : Strengthen your coding, algorithms. This is one most important thing for OYO. Practice Graph, tree, DP, greedy, recursion, data structures questions.
Tip 2 : OS, DBMS concepts will give you an edge over others. Like serialisation, index, deadlock, semaphore
Tip 3 : Only mention those projects in your resume which you are very clear about. They don't ask for detailed explanation, just an overall idea about your projects will increase your chances
Tip 1 : Mention college projects wisely. No need to mention fancy projects. Any project that you can describe to the interviewer will be a best solution
Tip 2 : Neat & clean resume with your skills, technical stacks that you mastered. That's all. They don't require you to be very active in extra-curricular activities, and these things will not give you any advantage.
Tip 3 : Keep it of single page
Skills evaluated in this interview
Top trending discussions
Interview questions from similar companies
Interview Questionnaire
10 Questions
- Q1. What do you do when your schedule is interrupted? How you handle it?
- Ans.
I prioritize tasks, communicate effectively, and adapt my plans to manage interruptions while maintaining productivity.
Assess the interruption: Determine its urgency and importance. For example, if a team member needs immediate help, I prioritize that.
Reorganize my tasks: I create a new plan that accommodates the interruption while ensuring critical deadlines are met.
Communicate with stakeholders: I inform my team or m...
- Q2. PreOrder traversal without recursion?
- Q3. Build a bst out of the unsorted array by looping over the array and inserting each element to the tree?
- Ans.
Yes
Create an empty binary search tree (BST)
Loop over the unsorted array
For each element, insert it into the BST using the appropriate insertion logic
Repeat until all elements are inserted
The resulting BST will be built from the unsorted array
- Q4. Find 2 elements in array whose sum is equal to given number?
- Ans.
The question asks to find two elements in an array whose sum is equal to a given number.
Iterate through the array and for each element, check if the difference between the given number and the current element exists in the array.
Use a hash set to store the elements as you iterate through the array for efficient lookup.
Return the pair of elements if found, otherwise return a message indicating no such pair exists.
- Q5. How many types of trigger?
- Ans.
There are two types of triggers: DML triggers and DDL triggers.
DML triggers are fired in response to DML (Data Manipulation Language) statements like INSERT, UPDATE, DELETE.
DDL triggers are fired in response to DDL (Data Definition Language) statements like CREATE, ALTER, DROP.
Examples: A DML trigger can be used to log changes made to a table, while a DDL trigger can be used to enforce certain rules when a table is alt...
- Q6. Can trigger be used with select statement?
- Ans.
Yes, triggers can be used with select statements in SQL.
Triggers are database objects that are automatically executed in response to certain events, such as insert, update, or delete operations.
While triggers are commonly used with insert, update, and delete statements, they can also be used with select statements.
Using triggers with select statements allows you to perform additional actions or validations before or af...
- Q7. Indexing in mysql? How many types of indexing in mysql?
- Ans.
Indexing in MySQL improves query performance. There are several types of indexing in MySQL.
Indexes are used to quickly locate data without scanning the entire table.
Types of indexing in MySQL include B-tree, hash, full-text, and spatial indexes.
B-tree indexes are the most common and suitable for most use cases.
Hash indexes are used for exact match lookups.
Full-text indexes are used for searching text-based data efficie...
- Q8. Engines in mysql?
- Ans.
Engines in MySQL are the underlying software components that handle storage, indexing, and querying of data.
MySQL supports multiple storage engines, each with its own strengths and features.
Some commonly used engines in MySQL are InnoDB, MyISAM, and Memory.
InnoDB is the default engine in MySQL and provides support for transactions and foreign keys.
MyISAM is known for its simplicity and speed but lacks transaction suppo...
- Q9. Singlton pattern?
- Ans.
The Singleton pattern ensures a class has only one instance and provides a global point of access to it.
Restricts instantiation of a class to a single object.
Useful for managing shared resources, like database connections.
Implemented using private constructors and static methods.
Example in Java: public class Singleton { private static Singleton instance; private Singleton() {} public static Singleton getInstance() { if...
- Q10. Can a constructor be private?
- Ans.
Yes, a constructor can be private.
A private constructor can only be accessed within the class itself.
It is often used in singleton design pattern to restrict object creation.
Private constructors are also useful for utility classes that only contain static methods.
Interview Preparation Tips
College Name: na
Skills evaluated in this interview
I appeared for an interview before Dec 2020.
(2 Questions)
Round duration - 60 Minutes
Round difficulty - Medium
This round was purely based on Data Structures and Algorithms . One has to be fairly comfortable in solving Algorithmic problems to pass this round . Both the questions asked were quite common and luckily I had already prepared them from CodeStudio and LeetCode.
- Q1.
Binary Tree Traversals Problem Statement
Given a Binary Tree with 'N' nodes, where each node holds an integer value, your task is to compute the In-Order, Pre-Order, and Post-Order traversals of the binar...
- Ans.
Compute the In-Order, Pre-Order, and Post-Order traversals of a Binary Tree given in level-order format.
Implement functions to perform In-Order, Pre-Order, and Post-Order traversals of a Binary Tree.
Use level-order input to construct the Binary Tree.
Traverse the Binary Tree recursively to generate the required traversals.
Ensure proper handling of null nodes represented by -1 in the input.
Return the three traversals as ...
- Q2.
Reverse Linked List Problem Statement
Given a Singly Linked List of integers, your task is to reverse the Linked List by altering the links between the nodes.
Input:
The first line of input is an intege...
(1 Question)
Round duration - 45 Minutes
Round difficulty - Medium
This round basically tested some concepts from Data Structures and File Manipulation .
- Q1.
Intersection of Two Arrays Problem Statement
Given two arrays
AandBwith sizesNandMrespectively, both sorted in non-decreasing order, determine their intersection.The intersection of two arrays in...
- Ans.
The problem involves finding the intersection of two sorted arrays efficiently.
Use two pointers to iterate through both arrays simultaneously.
Compare elements at the pointers and move the pointers accordingly.
Handle cases where elements are equal and update the intersection array.
Return the intersection array as the result.
Interview Preparation Tips
Tip 1 : Must do Previously asked Interview as well as Online Test Questions.
Tip 2 : Go through all the previous interview experiences from Codestudio and Leetcode.
Tip 3 : Do at-least 2 good projects and you must know every bit of them.
Tip 1 : Have at-least 2 good projects explained in short with all important points covered.
Tip 2 : Every skill must be mentioned.
Tip 3 : Focus on skills, projects and experiences more.
Skills evaluated in this interview
I appeared for an interview before Dec 2020.
(1 Question)
Round duration - 90 minutes
Round difficulty - Easy
Myntra had conducted a coding test on campus before the start of the placement season with 2 questions, one on stack and other on DP.
Tips : For the test, the DP question asked was pretty standard, on Longest Common Subsequence. The question on stacks, I don't remember what it was but it was also pretty straight forward. For the test, I would recommend to solve problem from GFG. If they do come to resume shortlisting, they are looking for people who have done good projects and internships.
- Q1.
Longest Common Subsequence Problem Statement
Given two strings
STR1andSTR2, determine the length of their longest common subsequence.A subsequence is a sequence that can be derived from another sequen...
(1 Question)
Round duration - 60 minutes
Round difficulty - Easy
The interview started off with questions on my general interest in Software Development. The first round had two coding questions, I was supposed to write the code on paper.
For the questions, they asked me to code the solution first. And then gave a specific input and asked me to demonstrate step by step in my code, how it would lead to the correct answer.
Tips: It's ok if you can't code a general solution, if you can write a code which works for the particular input they have given then also it's ok with them. But be thorough with Data structures.
- Q1.
Add Two Numbers as Linked Lists
You are given two singly linked lists, where each list represents a positive number without any leading zeros.
Your task is to add these two numbers and return the sum as ...
(3 Questions)
Round duration - 60 minutes
Round difficulty - Medium
I wasn't asked to write any code in this interview. They asked me some questions on Machine Learning, because of my projects in them. Then they asked me if I knew graph algorithms. Since I knew BFS and DFS, I told them. They asked the difference between the two. Then they asked me if I knew how to find the shortest distance between two points in a graph. I didn't know Dijkstra's properly but I knew it worked on the greedy approach so was able to tell that. Then they asked me how would I find the second shortest path. I tried to answer it with the same greedy approach, but couldn't arrive at the complete solution.
Tips: They ask a tough theoretical question. It's ok if you don't know the answer, they only look for your approach.
- Q1.
BFS Traversal in a Graph
Given an undirected and disconnected graph G(V, E) where V vertices are numbered from 0 to V-1, and E represents edges, your task is to output the BFS traversal starting from the ...
- Q2.
DFS Traversal Problem Statement
Given an undirected and disconnected graph
G(V, E), whereVis the number of vertices andEis the number of edges, the connections between vertices are provided in the 'GR... - Q3.
Dijkstra's Shortest Path Problem
Given an undirected graph with ‘V’ vertices (labeled 0, 1, ... , V-1) and ‘E’ edges, where each edge has a weight representing the distance between two connected nodes (X,...
- Ans.
Dijkstra's algorithm is used to find the shortest path from a source node to all other nodes in a graph with weighted edges.
Implement Dijkstra's algorithm to find the shortest path distances from the source node to all other nodes in the graph.
Use a priority queue to efficiently select the next node with the shortest distance.
Update the distances of neighboring nodes based on the current node's distance and edge weight...
Interview Preparation Tips
Tip 1 : Be thorough with Data Structures and Algorithms and also with your resume.
Tip 2 : Must do Previously asked Interview as well as Online Test Questions.
Tip 3 : Go through all the previous interview experiences from Codestudio and Leetcode.
Tip 4 : Do at-least 2 good projects and you must know every bit of them.
Tip 1 : Have at-least 2 good projects explained in short with all important points covered.
Tip 2 : Every skill must be mentioned.
Tip 3 : Focus on skills, projects and experiences more.
Skills evaluated in this interview
Thommandru Vishnu
Interview Questionnaire
9 Questions
- Q1. All the leaf nodes of tree are doubly linked,print only the leaf nodes of a tree
- Ans.
Print only the leaf nodes of a doubly linked tree.
Traverse the tree and check if a node has no children and both left and right pointers are null.
If yes, then it is a leaf node and print it.
If no, then continue traversing the tree.
Use recursion to traverse the tree in a depth-first manner.
- Q2. LRU page Replacement Algorithm for large data
- Ans.
LRU page replacement algorithm is used to replace the least recently used page in memory with a new page.
LRU stands for Least Recently Used
It is a cache eviction algorithm
It is used to manage memory in operating systems
It works by keeping track of the pages that are used recently and the ones that are not
When a new page is to be loaded into memory, the algorithm checks which page has not been used for the longest time ...
- Q3. Given a linked list with 2 parameters m,n. Now start reversing the m nodes and leave n nodes and continue it till u reach the end
- Ans.
Reverse m nodes and leave n nodes in a linked list till the end.
Traverse the linked list till m nodes and reverse them
Traverse n nodes and continue reversing m nodes
Repeat the above step till the end of the linked list
Handle edge cases like m or n being greater than the length of the linked list
- Q4. Inorder Traversal of a tree
- Ans.
Inorder traversal is a way of visiting all nodes in a binary tree by visiting the left subtree, then the root, and then the right subtree.
Start at the root node
Traverse the left subtree recursively
Visit the root node
Traverse the right subtree recursively
Repeat until all nodes have been visited
- Q5. Inorder Travesal of a tree without recursion(write the code)
- Q6. Given an array of numbers in which duplicates are there and one triplicate is there. find that number
- Ans.
Find the triplicate number in an array of duplicates.
Iterate through the array and keep track of the frequency of each number.
Return the number that appears three times.
If no number appears three times, return null.
- Q7. Explain all the serach algorithm you know with space and Time complexities
- Ans.
Explanation of search algorithms with their space and time complexities.
Linear Search - O(n) time complexity, O(1) space complexity
Binary Search - O(log n) time complexity, O(1) space complexity
Jump Search - O(√n) time complexity, O(1) space complexity
Interpolation Search - O(log log n) time complexity, O(1) space complexity
Exponential Search - O(log n) time complexity, O(1) space complexity
Fibonacci Search - O(log n) ...
- Q8. Given a situation and asks you which search algorithm suits the best in that situation
- Ans.
Choosing the right search algorithm depends on data structure, size, and specific requirements like speed or memory usage.
Binary Search: Efficient for sorted arrays, O(log n) time complexity. Example: Finding a number in a sorted list.
Linear Search: Simple and works on unsorted arrays, O(n) time complexity. Example: Searching for a name in an unsorted list.
Depth-First Search (DFS): Suitable for tree/graph traversal, ex...
- Q9. Given an array of length n and in which numbers from 1-n will be there and each number can repeat any number of times find out which repeated more number of times
- Ans.
Find the most repeated number in an array of length n with numbers 1-n.
Create a dictionary to store the count of each number in the array
Iterate through the array and update the count in the dictionary
Find the key with the highest count in the dictionary
Interview Preparation Tips
Experience: Basically, it's not resume shortlist, it's a 9 pointer shortlist
Round: Test
Experience: The Entire Test is held in HackerRank Platform. it has
2 coding questions (one easy and one medium)
2 output questions(medium)
2 Aptitude(easy)
1 general Computer science(medium)
it took me 30 min for each coding questions.I was not known that general question is related to bash commands.
Tips: Practice the Warmup questions in Hacker Rank.
Do some Basic aptitude questions.
Thorough with the basic c and c++ concepts
Duration: 120 minutes
Total Questions: 7
Round: Technical Interview
Experience: It's completely around the data structures. The questions are a bit tricky but once u think without any tension u can get through easily. The interviewer is helpful and gives u few hints if u catch them at the right point of time u got it.There are 2 more questions which I haven't mentioned.
Tips: got through Data Structures and Algorithms Made Easy by Narasimha Karumanchi. It's a best book for the interviews.
Round: Technical Interview
Experience: The interviewer asked to put everything on the blackboard and write down the code of each and everything.
Tips: Go to the website -----/ and study all the interview questions and modules
Round: HR Interview
Experience: It's Technical+ HR interview all the technical questions went around resume. it went around 45 minutes they are very particular about what you wrote in the resume.HR questions are general like
whats your future plans
where will u see yourself in the office after 5 years?
Tips: please make sure that whatever you write in resume should be known to you very well.Don't write false things about yourself.And make sure you know completely about the projects you are going to write in resume(atleast the part you worked)
General Tips: Be sure of what you are saying. Don't be tensed and answer to your best.
Skills: Programming, Data Structures
College Name: VIT VELLORE
Skills evaluated in this interview
Interview Questionnaire
10 Questions
- Q1. Change Binary tree so that parent node is the sum of root nodes
- Q2. Reverse a linkedlist ?
- Q3. Given an array of +ve and -ve numbers , have to rearrange them ( like +ve numbers to left and -ve numbers to right of the array)
- Q4. Singleton pattern, observer pattern?
- Q5. String pool and how garbage collection functionality works?
- Ans.
String pool is a cache of string literals in memory. Garbage collection frees up memory by removing unused objects.
String pool is a cache of string literals in memory
Strings are immutable and can be shared among multiple objects
Garbage collection removes unused objects to free up memory
String objects that are no longer referenced are eligible for garbage collection
- Q6. HashMap , how can you synchronize ?
- Q7. Process vs Thread differences and synchronization,deadlock examples?
- Ans.
Process vs Thread differences and synchronization, deadlock examples
Process is an instance of a program while thread is a subset of a process
Processes are independent while threads share the same memory space
Synchronization is used to coordinate access to shared resources
Deadlock occurs when two or more threads are blocked waiting for each other to release resources
Examples of synchronization include mutex, semaphore, ...
- Q8. Database: Design with one-one mapping, one-many mapping…some basic questions, I don’t remember all
- Q9. Design a website where after user request. A bunch of processes need to be executed and then a mail is sent to user with the result. Take care of scalability etc?
- Ans.
Design a scalable website to process user requests and send email results asynchronously.
Use a microservices architecture to handle different processes independently.
Implement a message queue (e.g., RabbitMQ, Kafka) to manage requests and responses.
Utilize cloud services (e.g., AWS Lambda) for scalable processing of tasks.
Send emails using a reliable service (e.g., SendGrid, Amazon SES) to ensure delivery.
Implement loa...
- Q10. CTO round
Interview Preparation Tips
Experience: This was CTO round, if you make this round…you are doing pretty good.
He asked a lot on what I worked on and asked questions relevant to that. Process thread, stacks heaps. A minor system design on component in their system. How they are shared between and trade-off. We discussed about scalability and challenge.
General Tips: Process:5 technical ( 3 rounds+ SVP round + CTO round ) + 1 HR
I got almost the same package that I am currently getting (Myntra gave stock options, which I don’t have in my current company) but I am looking for a change so accepted the offer.
Skills: Algorithm, data structure, database
College Name: na
Skills evaluated in this interview
I appeared for an interview before Dec 2020.
(2 Questions)
Round duration - 120 minutes
Round difficulty - Medium
The Entire Test is held in HackerRank Platform. It has:
2 coding questions (one easy and one medium)
2 output questions(medium)
2 Aptitude(easy)
1 general Computer science(medium)
It took me 30 min for each coding questions. I did not know that general question is related to bash commands.
Tips: Practice the Warmup questions in Hacker Rank.
Do some Basic aptitude questions.
Thorough with the basic C and C++ concepts
- Q1.
Binary Tree to Doubly Linked List
Transform a given Binary Tree into a Doubly Linked List.
Ensure that the nodes in the Doubly Linked List follow the Inorder Traversal of the Binary Tree.
Input:
The fi... - Q2.
Unique Element in Array
Given an arbitrary array
arrconsisting ofNnon-negative integers where every element appears thrice except for one. Your task is to find the element in the array that appears onl...
(2 Questions)
Round duration - 60 minutes
Round difficulty - Medium
It's completely around the data structures. The questions are a bit tricky but once u think without any tension u can get through easily. The interviewer is helpful and gives u few hints if u catch them at the right point of time u got it.
Tips: got through Data Structures and Algorithms Made Easy by Narasimha Karumanchi. It's a best book for the interviews.
- Q1.
Binary Tree Traversals Problem Statement
Given a Binary Tree with 'N' nodes, where each node holds an integer value, your task is to compute the In-Order, Pre-Order, and Post-Order traversals of the binar...
- Ans.
Implement a function to compute In-Order, Pre-Order, and Post-Order traversals of a Binary Tree given in level-order format.
Parse the input level-order tree elements to construct the binary tree.
Implement recursive functions for In-Order, Pre-Order, and Post-Order traversals.
Return the traversals as lists of lists for each test case.
- Q2.
Delete N Nodes After M Nodes in a Linked List
Given a singly linked list and two integers 'N' and 'M', traverse the linked list to retain 'M' nodes and then delete the next 'N' nodes. Continue this proces...
(1 Question)
Round duration - 60 minutes
Round difficulty - Easy
The interviewer asked to put everything on the blackboard and write down the code of each and everything.
Question : Explain all the search algorithm you know with space and Time complexities.
Answer : Linear search : It is a sequential search algorithm where the entire array is traversed till the desired element is not found. Time complexity is O(N) and auxiliary space is O(1).
Binary search : In this algorithm, a sorted array is searched by repeatedly dividing the search interval in half.
Steps :
1. Initially the interval covers the whole array.
2. If the value to be searched is less than the item in the middle of the interval, narrow the interval to the lower half. Otherwise, narrow it to the upper half.
3. The process is repeated until the value is found or the interval is empty.
Time complexity is O(log n) and auxiliary space is O(1) in case of iterative implementation.
- Q1.
Maximum Frequency Number Problem Statement
Given an array of integers with numbers in random order, write a program to find and return the number which appears the most frequently in the array.
If multip...
Interview Preparation Tips
Tip 1 : Must do Previously asked Interview as well as Online Test Questions.
Tip 2 : Go through all the previous interview experiences from Codestudio and Leetcode.
Tip 3 : Do at-least 2 good projects and you must know every bit of them.
Tip 1 : Have at-least 2 good projects explained in short with all important points covered.
Tip 2 : Every skill must be mentioned.
Tip 3 : Focus on skills, projects and experiences more.
Skills evaluated in this interview
I appeared for an interview before Dec 2020.
(2 Questions)
Round duration - 120 minutes
Round difficulty - Medium
This was a 2 hour round consisting of 5 mcqs and 2 codes. The mcqs were pretty much simple based on DS, DBMS, OS, OOP, and C.
- Q1.
Rabbit Jumping Problem
Consider 'n' carrots numbered from 1 to 'n' and 'k' rabbits. Each rabbit jumps to carrots only at multiples of its respective jumping factor Aj (i.e., Aj, 2Aj, 3Aj, ...), for all ra...
- Q2.
Flip Bits Problem Explanation
Given an array of integers
ARRof size N, consisting of 0s and 1s, you need to select a sub-array and flip its bits. Your task is to return the maximum count of 1s that can b...
(2 Questions)
Round duration - 60 minutes
Round difficulty - Medium
Started with a brief discussion on my projects and internships. A thorough discussion on whichever languages, frameworks I had used in my projects. Followed by discussion on coding questions. Apart from the codes there were some questions on OS, process stack, heap memory in Java, Garbage collection, OOP principles and comparison based sorting
- Q1.
Sum of Maximum and Minimum Elements Problem Statement
Given an array
ARRof sizeN, your objective is to determine the sum of the largest and smallest elements within the array.Follow Up:
Can you achie...
- Ans.
Find sum of maximum and minimum elements in an array with least number of comparisons.
Iterate through the array and compare each element with current maximum and minimum to update them.
Initialize max as smallest possible value and min as largest possible value.
Return the sum of max and min after iterating through the array.
- Q2.
Invert a Binary Tree Problem Statement
Given a Binary Tree and one of its leaf nodes, invert the binary tree by following these guidelines:
• The given leaf node becomes the root after the inversion. • F...
- Ans.
Invert a binary tree based on a given leaf node as the root.
Start by finding the leaf node in the binary tree.
Move the left child of the leaf node to the right side of the leaf node.
Make the parent of the leaf node the left child of the leaf node.
Repeat the process for each test case.
Return the inverted binary tree in level order format.
(3 Questions)
Round duration - 60 minutes
Round difficulty - Medium
Questions based on programming, DBMS and puzzles were asked in this round.
- Q1.
Rearrange Array to Form Largest Number
Given an array
ARRconsisting of non-negative integers, rearrange the numbers to form the largest possible number. The digits within each number cannot be changed....
- Q2. What is indexing in the context of databases?
- Ans.
Indexing in databases is a technique used to improve the speed of data retrieval by creating a data structure that allows for quick lookups.
Indexes are created on columns in a database table to speed up the retrieval of rows that match a certain condition.
They work similar to the index in a book, allowing the database to quickly find the relevant data without having to scan the entire table.
Examples of indexes include ...
- Q3. What are the advantages of B+ Trees in database management systems?
- Ans.
B+ Trees are advantageous in database management systems due to their ability to efficiently store and retrieve data.
B+ Trees have a high fanout, allowing for more keys to be stored in each node, reducing the height of the tree and improving search performance.
B+ Trees are balanced trees, ensuring that operations like search, insertion, and deletion have a predictable time complexity of O(log n).
B+ Trees are optimized ...
Round duration - 45 minutes
Round difficulty - Medium
Puzzles and HR based questions were asked in this round.
He asked questions like : what are my career goals, what do you look forward to in a boss , how do you see yourself in 5 years ,etc etc .
Interview Preparation Tips
Tip 1 : Must do Previously asked Interview as well as Online Test Questions.
Tip 2 : Go through all the previous interview experiences from Codestudio and Leetcode.
Tip 3 : Do at-least 2 good projects and you must know every bit of them.
Tip 1 : Have at-least 2 good projects explained in short with all important points covered.
Tip 2 : Every skill must be mentioned.
Tip 3 : Focus on skills, projects and experiences more
Skills evaluated in this interview
Oyo Rooms Interview FAQs
Tell us how to improve this page.
Oyo Rooms Interviews By Designations
- Oyo Rooms Business Development Manager Interview Questions
- Oyo Rooms Software Developer Interview Questions
- Oyo Rooms Demand Manager Interview Questions
- Oyo Rooms Business Analyst Interview Questions
- Oyo Rooms Software Engineer Interview Questions
- Oyo Rooms Relationship Manager Interview Questions
- Oyo Rooms Hotel Manager Interview Questions
- Oyo Rooms Analyst Interview Questions
- Show more
Interview Questions for Popular Designations
- Software Engineer Interview Questions
- Java Developer Interview Questions
- Web Developer Interview Questions
- Senior Software Developer Interview Questions
- Application Developer Interview Questions
- Salesforce Developer Interview Questions
- Software Development Engineer Interview Questions
- Developer Interview Questions
- Show more
Top Skills for Oyo Rooms Software Developer
Software Developer Interview Questions from Similar Companies
Oyo Rooms Software Developer Reviews and Ratings
based on 22 reviews
Rating in categories
|
Business Development Manager
1.6k
salaries
|  ₹5 L/yr - ₹12.2 L/yr |
|
Demand Manager
713
salaries
| ₹4.8 L/yr - ₹9.3 L/yr |
|
Hotel Manager
440
salaries
| ₹1.5 L/yr - ₹4.9 L/yr |
|
Area Business Manager
338
salaries
| ₹4.3 L/yr - ₹10 L/yr |
|
Area Supply Manager
328
salaries
| ₹8.8 L/yr - ₹16.3 L/yr |
Udaan
BigBasket
Swiggy
Blinkit
- Home >
- Interviews >
- Oyo Rooms Interview Questions >
- Oyo Rooms Interview Questions for Fresher
