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

Clear (1)

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

Updated 16 Sep 2021

Top Oyo Rooms Software Developer Intern Interview Questions and Answers

  • Q1. Candies Distribution Problem Statement Prateek is a kindergarten teacher with a mission to distribute candies to students based on their performance. Each student must g ...read more
  • Q2. Leaves at Same Level Problem Statement Given a binary tree with 'N' nodes, determine if all the leaf nodes are situated at the same level. Return true if all the leaf no ...read more
  • Q3. Boolean Matrix Transformation Challenge Given a 2-dimensional boolean matrix mat of size N x M, your task is to modify the matrix such that if any element is 1, set its ...read more
View all 18 questions

Oyo Rooms Software Developer Intern Interview Experiences

4 interviews found

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.

    • Recursively try moving in all directions (up, down, left, right) until reaching the destination.

    • Add the path to the result list when the destination is reached.

    • Sort the result list alphabetically before returning.

  • 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 specified rules.

    • Use BFS traversal to explore all possible paths from the starting point to the destination.

    • Keep track of the cost incurred at each cell and update it accordingly.

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

  • Answered by AI

Interview Preparation Tips

Eligibility criteriaAbove 7 CGPAOYO interview preparation:Topics to prepare for the interview - Data Structures, Pointers, OOPS, System Design, Algorithms, Dynamic ProgrammingTime 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 : Have some projects on resume.
Tip 2 : Keep it short.

Final outcome of the interviewRejected

Skills evaluated in this interview

I was interviewed in Dec 2020.

Round 1 - Video Call 

(2 Questions)

Round duration - 90 minutes
Round difficulty - Easy

  • Q1. 

    Cycle Detection in a Directed Graph

    Given a directed graph, you need to determine whether or not the graph contains a cycle.

    Your function should return true if there is at least one cycle in the graph; ...

  • Ans. 

    Detect cycles in a directed graph and return true if a cycle exists, false otherwise.

    • Use Depth First Search (DFS) to detect cycles in the graph.

    • Maintain a visited array to keep track of visited vertices and a recursion stack to keep track of vertices in the current DFS traversal.

    • If a vertex is visited and is present in the recursion stack, then a cycle exists.

    • Example: For the input graph with vertices 0, 1, 2 and edges...

  • Answered by AI
  • Q2. 

    Next Permutation Problem Statement

    Given a permutation of ‘N’ integers, rearrange them to generate the lexicographically next greater permutation. A sequence is a permutation if it contains all integers f...

  • Ans. 

    The problem involves rearranging a permutation of integers to generate the lexicographically next greater permutation.

    • Understand the concept of lexicographically next greater permutation.

    • Implement a function to find the next greater permutation.

    • Handle cases where no greater permutation exists by returning the smallest permutation.

  • Answered by AI
Round 2 - Video Call 

(1 Question)

Round duration - 60 minutes
Round difficulty - Easy

  • Q1. 

    Validate BST Problem Statement

    Given a binary tree with N nodes, determine whether the tree is a Binary Search Tree (BST). If it is a BST, return true; otherwise, return false.

    A binary search tree (BST)...

  • Ans. 

    Validate if a binary tree is a Binary Search Tree (BST) or not.

    • Check if the left subtree of a node contains only nodes with data less than the node's data.

    • Check if the right subtree of a node contains only nodes with data greater than the node's data.

    • Recursively check if both the left and right subtrees are also binary search trees.

  • Answered by AI

Interview Preparation Tips

Eligibility criteriaBTech(IT, EC), Dual (IT & EC) with no active backlog.OYO interview preparation:Topics to prepare for the interview - Data Structures, Algorithms, Oops, System Design, Data Base, NetworksTime required to prepare for the interview - 4 monthsInterview preparation tips for other job seekers

Tip 1 : Prepare Data Structures
Tip 2 : Solve atleast 300-400 problems
Tip 3 : Prepare computer science subjects for solving MCQ's

Application resume tips for other job seekers

Tip 1 : Projects around oops would be great
Tip 2 : Be confident about everything you write

Final outcome of the interviewSelected

Skills evaluated in this interview

Software Developer Intern Interview Questions Asked at Other Companies

Q1. Sum of Maximum and Minimum Elements Problem Statement Given an ar ... read more
asked in Amazon
Q2. Fish Eater Problem Statement In a river where water flows from le ... read more
asked in Apple
Q3. Kevin and his Fruits Problem Statement Kevin has 'N' buckets, eac ... read more
asked in CommVault
Q4. Sliding Maximum Problem Statement Given an array of integers ARR ... read more
Q5. Reverse Words in a String: Problem Statement You are given a stri ... read more

I was interviewed in Nov 2020.

Round 1 - Coding Test 

(2 Questions)

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 Distribution Problem Statement

    Prateek is a kindergarten teacher with a mission to distribute candies to students based on their performance. Each student must get at least one candy, and if two s...

  • Ans. 

    The task is to distribute candies to students based on their performance while minimizing the total candies distributed.

    • Iterate through the array of student ratings to determine the minimum number of candies required.

    • Assign each student at least one candy.

    • Adjust the number of candies based on the ratings of adjacent students to minimize the total candies distributed.

    • Example: For ratings [5, 8, 1, 5, 9, 4], the optimal ...

  • Answered by AI
  • Q2. 

    Problem Statement: Minimum Cost to Buy Ninja Blades

    Ninja Yuki wants to purchase ninja blades at the Spring Fair in his village. Initially, he has 0 blades, and his goal is to buy 'N' blades. The merchant...

  • Ans. 

    Calculate the minimum cost to acquire a specific number of ninja blades using a given pricing mechanism.

    • Iterate through each test case to determine the minimum cost needed to acquire the desired number of blades.

    • Consider the cost of adding 1 blade versus doubling the current number of blades to reach the target quantity.

    • Keep track of the total cost as blades are acquired based on the pricing mechanism.

    • Return the minimu

  • Answered by AI
Round 2 - Video Call 

(2 Questions)

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 Stream Problem Statement

    Given a string A consisting of lowercase English letters, determine the first non-repeating character at each point in the stream of characters.

    Examp...

  • Ans. 

    Given a string of lowercase English letters, find the first non-repeating character at each point in the stream.

    • Iterate through the characters in the string and maintain a count of each character.

    • Use a queue to keep track of the order of characters encountered.

    • For each character, check if it is the first non-repeating character by looking at its count in the map.

    • If a character's count is 1, it is the first non-repeatin...

  • Answered by AI
  • Q2. 

    Boolean Matrix Transformation Challenge

    Given a 2-dimensional boolean matrix mat of size N x M, your task is to modify the matrix such that if any element is 1, set its entire row and column to 1. Specifi...

  • Ans. 

    Modify a boolean matrix such that if any element is 1, set its entire row and column to 1 in-place.

    • Iterate through the matrix to find elements with value 1.

    • Use additional arrays to keep track of rows and columns to be modified.

    • Update the matrix in-place based on the identified rows and columns.

  • Answered by AI
Round 3 - Video Call 

(2 Questions)

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 Index-Multiplied Rotations

    Given an array ARR of size N, determine the maximum sum of i * ARR[i] possible through any number of rotations. Both left and right rotations are allowed, and can...

  • Ans. 

    Find maximum sum of i * ARR[i] possible through any number of rotations in an array.

    • Calculate the sum of i * ARR[i] for each rotation and find the maximum sum.

    • Consider both left and right rotations.

    • Optimize the solution to avoid redundant calculations.

    • Handle edge cases like empty array or single element array.

  • Answered by AI
  • Q2. 

    Averages of Levels in Binary Tree Problem Statement

    Given an arbitrary binary tree consisting of 'N' nodes numbered from 1 to 'N'. Each node is associated with a positive integer value. Your task is to ca...

  • Ans. 

    Calculate the average of node values at each level in a binary tree.

    • Traverse the binary tree level by level using BFS

    • Calculate the sum of node values at each level and divide by the number of nodes at that level

    • Print the floor value of the average for each level

  • Answered by AI

Interview Preparation Tips

Professional and academic backgroundI applied for the job as SDE - Intern in GurgaonEligibility criteriaAbove 6.45 CGPAOYO interview preparation:Topics to prepare for the interview - Data Structures, Algorithms, Dynamic Programming, Machine Learning, OOPSTime required to prepare for the interview - 6 monthsInterview preparation tips for other job seekers

Tip 1 : Primary skill to be developed is problem solving, i.e proficient in data structures and algorithms.
Tip 2 : After this, practice competitive programming, start giving contests, this will make you faster.
Tip 3 : Then take any technology, e.g., machine learning, web development etc., make few but good projects using these technologies.

Application resume tips for other job seekers

Tip 1 : Make it short, 1-2 pages max. Only mention those projects that you know the best.
Tip 2 : While mentioning projects, do mention numbers in them, like what was the accuracy(in case of ML projects).

Final outcome of the interviewSelected

Skills evaluated in this interview

I was interviewed before Sep 2020.

Round 1 - Coding Test 

(2 Questions)

Round duration - 60 minutes
Round difficulty - Medium

  • Q1. 

    Longest Increasing Subsequence Problem Statement

    Given an array of integers with 'N' elements, determine the length of the longest subsequence where each element is greater than the previous element. This...

  • Ans. 

    Find the length of the longest strictly increasing subsequence in an array of integers.

    • Use dynamic programming to keep track of the longest increasing subsequence ending at each element.

    • Initialize an array to store the length of the longest increasing subsequence ending at each index.

    • Iterate through the array and update the length of the longest increasing subsequence for each element.

    • Return the maximum value in the ar...

  • Answered by AI
  • Q2. 

    Digits Decoding Problem

    Ninja has a string of characters from 'A' to 'Z', encoded using their numeric values (A=1, B=2, ..., Z=26). The encoded string is given as a sequence of digits (SEQ). The task is t...

  • Ans. 

    The task is to determine the number of possible ways to decode a sequence of digits back into a string of characters from 'A' to 'Z'.

    • Use dynamic programming to keep track of the number of ways to decode the sequence at each position.

    • Consider different cases when decoding the sequence, such as single digit decoding and double digit decoding.

    • Handle edge cases like '0' and '00' appropriately.

    • Return the final count modulo

  • Answered by AI
Round 2 - Face to Face 

(2 Questions)

Round duration - 60 minutes
Round difficulty - Medium

  • Q1. 

    Leaves at Same Level Problem Statement

    Given a binary tree with 'N' nodes, determine if all the leaf nodes are situated at the same level. Return true if all the leaf nodes are at the same level, otherwis...

  • Ans. 

    Check if all leaf nodes in a binary tree are at the same level.

    • Traverse the binary tree and keep track of the level of each leaf node.

    • Compare the levels of all leaf nodes at the end to determine if they are at the same level.

    • Use a queue for level order traversal of the binary tree.

  • Answered by AI
  • Q2. 

    Maximum Non-Adjacent Subsequence Sum

    Given an array of integers, determine the maximum sum of a subsequence without choosing adjacent elements in the original array.

    Input:

    The first line consists of an...
  • Ans. 

    Find the maximum sum of a subsequence without choosing adjacent elements in an array.

    • Use dynamic programming to keep track of the maximum sum of non-adjacent elements at each index.

    • At each index, the maximum sum is either the sum of the current element and the element two positions back, or the sum at the previous index.

    • Iterate through the array and update the maximum sum at each index accordingly.

    • Return the maximum su

  • Answered by AI
Round 3 - Face to Face 

(3 Questions)

Round duration - 60 minutes
Round difficulty - Medium

  • Q1. 

    LRU Cache Design Question

    Design a data structure for a Least Recently Used (LRU) cache that supports the following operations:

    1. get(key) - Return the value of the key if it exists in the cache; otherw...

  • Ans. 

    Design a Least Recently Used (LRU) cache data structure that supports get and put operations with capacity constraint.

    • Use a combination of hashmap and doubly linked list to implement the LRU cache.

    • Keep track of the least recently used item and update it accordingly when inserting new items.

    • Ensure to handle the capacity constraint by evicting the least recently used item when the cache is full.

    • Implement get(key) and put...

  • Answered by AI
  • Q2. What is the difference between Mutex and Semaphores?
  • Ans. 

    Mutex is used for exclusive access to a resource by only one thread at a time, while Semaphores can allow multiple threads to access a resource simultaneously.

    • Mutex is binary and can be locked by only one thread at a time, while Semaphores can have a count greater than one.

    • Mutex is used for protecting critical sections of code, while Semaphores can be used for controlling access to a pool of resources.

    • Mutex is simpler ...

  • Answered by AI
  • Q3. Given the employee and department tables, how would you find the number of employees in each department? (This question focuses on SQL Joins.)
  • Ans. 

    Use SQL Joins to find the number of employees in each department.

    • Use a JOIN statement to combine the employee and department tables based on the department ID.

    • Group the results by department ID and use COUNT() function to find the number of employees in each department.

    • Example: SELECT department.department_id, COUNT(employee.employee_id) AS num_employees FROM department JOIN employee ON department.department_id = emplo...

  • Answered by AI

Interview Preparation Tips

Professional and academic backgroundI completed Computer Science Engineering from TIET - Thapar Institute of Engineering And Technology. I applied for the job as SDE - Intern in BangaloreEligibility criteria7 CGPAOYO interview preparation:Topics to prepare for the interview - Data Structure,Algorithms,OS,DBMS,OOPSTime required to prepare for the interview - 3 monthsInterview preparation tips for other job seekers

Tip 1 : Work on communicating effectively, give a lot of mock interviews. There is no point studying so hard if your thoughts or solution don't reach the interviewer.
Tip 2 : Practice variety of questions. 50 questions of different topics, patterns are better that 50 questions done for same topic.
Tip 3 : Try to think of solution by different approaches, this will expand your horizon by doing less questions.

Application resume tips for other job seekers

Tip 1 : Don't make a fancy resume, keep it simple, you can use Latex templates from overleaf.com.
Tip 2 : Make it short and crisp. Resume should not be more than 1 page. And don't write anything you're not confident about. For experienced people, read the JD first and design your resume accordingly.

Final outcome of the interviewSelected

Skills evaluated in this interview

Oyo Rooms interview questions for designations

 Software Developer

 (12)

 Frontend Developer Intern

 (1)

 Software Development Engineer Intern

 (2)

 Software Engineer

 (7)

 Operations Intern

 (1)

 Software Development Engineer

 (1)

 Software Engineer III

 (1)

 Senior Web Developer

 (1)

Interview questions from similar companies

Interview Questionnaire 

17 Questions

  • Q1. Find if a string is substring of other string
  • Ans. 

    The function checks if a string is a substring of another string.

    • Use the built-in string methods like 'indexOf' or 'includes' to check for substring.

    • If the language supports regular expressions, you can also use them to find substrings.

    • Consider the case sensitivity of the strings when comparing.

  • Answered by AI
  • Q2. Write a code to multiply two matrices of dimension M*N and N*K
  • Ans. 

    Code to multiply two matrices of dimension M*N and N*K.

    • Create a result matrix of dimension M*K.

    • Iterate through each row of the first matrix.

    • For each row, iterate through each column of the second matrix.

    • For each element in the row of the first matrix, multiply it with the corresponding element in the column of the second matrix.

    • Sum up the products and store the result in the corresponding position of the result matrix.

    • ...

  • Answered by AI
  • Q3. Write a Sql to perform Matrix Multiplication.Two tables has three columns row,col and value
  • Ans. 

    SQL query to perform matrix multiplication using two tables with row, col, and value columns.

    • Use JOIN operation to combine the two tables based on matching row and col values.

    • Use GROUP BY clause to group the result by row and col values.

    • Use SUM function to calculate the dot product of corresponding row and col values.

    • Use INSERT INTO statement to insert the result into a new table.

  • Answered by AI
  • Q4. What is prototype in javascript?
  • Ans. 

    Prototype in JavaScript is an object that is associated with every function and object by default.

    • Prototype is used to add properties and methods to an object.

    • It allows objects to inherit properties and methods from other objects.

    • Modifying the prototype of a function affects all instances of that function.

    • Prototypes can be used to create new objects based on existing objects.

    • The prototype chain allows for property and

  • Answered by AI
  • Q5. How do we write classes in javascript?
  • Ans. 

    Classes in JavaScript are written using the class keyword.

    • Use the class keyword followed by the class name to define a class.

    • Use the constructor method to initialize class properties.

    • Add methods to the class using the class prototype.

    • Use the new keyword to create an instance of the class.

  • Answered by AI
  • Q6. There is a ladder of N steps.We can either take 1 step or 2 steps.In how many different ways one can climb the ladder?
  • Ans. 

    The number of different ways to climb a ladder of N steps by taking 1 or 2 steps at a time.

    • This is a classic problem that can be solved using dynamic programming.

    • The number of ways to climb N steps is equal to the sum of the number of ways to climb N-1 steps and N-2 steps.

    • The base cases are when N is 0 or 1, where there is only 1 way to climb the ladder.

    • For example, for N=4, there are 5 different ways: [1, 1, 1, 1], [1

  • Answered by AI
  • Q7. Print a square matrix in spiral order
  • Ans. 

    Print a square matrix in spiral order

    • Start by defining the boundaries of the matrix

    • Iterate through the matrix in a spiral pattern, printing each element

    • Adjust the boundaries after each iteration to move inward

    • Repeat until all elements are printed

  • Answered by AI
  • Q8. Given a table with 3 columns StudentName,Subject and Marks.Write a sql to retrieve second highest Marks Obtained for each student
  • Ans. 

    Retrieve the second highest marks obtained by each student from a table with student name, subject, and marks.

    • Use the RANK() function to assign a rank to each row based on the marks in descending order.

    • Filter the result to only include rows with rank 2 for each student.

    • Group the result by student name to get the second highest marks for each student.

  • Answered by AI
  • Q9. Given a Website with header,footer,side ads(Google ads,Internal ads).How will you extract only useful data from the page
  • Q10. Difference between .live() and .delegate() in jquery
  • Ans. 

    The .live() method attaches an event handler to the current and future elements, while .delegate() attaches an event handler to a parent element.

    • The .live() method is deprecated in newer versions of jQuery.

    • The .delegate() method is preferred over .live() for performance reasons.

    • Both methods are used to handle events for dynamically added elements.

    • Example: $(document).live('click', 'button', function() { ... });

    • Example:...

  • Answered by AI
  • Q11. What is chaining in jquery?
  • Ans. 

    Chaining in jQuery allows multiple methods to be called on a single element in a single line of code.

    • Chaining simplifies code and improves readability.

    • Each method in the chain operates on the result of the previous method.

    • The chain ends with a method that does not return a jQuery object.

    • Example: $('div').addClass('highlight').fadeOut();

  • Answered by AI
  • Q12. What is callback function?
  • Ans. 

    A callback function is a function that is passed as an argument to another function and is executed later.

    • Callback functions are commonly used in event-driven programming.

    • They allow asynchronous execution of code.

    • Callback functions can be used to handle responses from APIs or user interactions.

    • They can be anonymous functions or named functions.

    • Example: setTimeout(function() { console.log('Hello!'); }, 1000);

  • Answered by AI
  • Q13. What is .bind() function in jquery?
  • Ans. 

    The .bind() function in jQuery is used to attach an event handler function to one or more elements.

    • It allows you to specify the event type and the function to be executed when the event occurs.

    • The .bind() function can be used to bind multiple events to the same element.

    • It can also be used to pass additional data to the event handler function.

    • The .bind() function is deprecated in jQuery version 3.0 and above. It is reco

  • Answered by AI
  • Q14. Find the angle between hour handle and minute handle in a clock
  • Ans. 

    The angle between the hour and minute hands of a clock can be calculated using a formula.

    • The hour hand moves 30 degrees per hour and 0.5 degrees per minute.

    • The minute hand moves 6 degrees per minute.

    • Calculate the angle between the two hands using the formula: |30H - 11M/2|, where H is the hour and M is the minute.

  • Answered by AI
  • Q15. Is it possible to create slideshow without using javascript
  • Ans. 

    Yes, it is possible to create a slideshow without using JavaScript.

    • Use CSS animations and transitions to create the slideshow.

    • Use HTML and CSS to structure and style the slideshow.

    • Utilize keyframe animations to create the slide transitions.

    • Use radio buttons or checkboxes to control the slideshow navigation.

    • Apply the :target pseudo-class to create a simple slideshow without JavaScript.

  • Answered by AI
  • Q16. Questions about my current project and academic project
  • Q17. Given two points A and B with distance between them lets say D.there are N men who want to go from point A to point B.All men walk with same speed.They also have one scooter with them which has speed grea...
  • Ans. 

    The men can take turns riding the scooter, allowing them to reach point B faster.

    • The men can form a queue and take turns riding the scooter.

    • The person riding the scooter can drop it off at a certain point and the next person can pick it up.

    • The scooter can be passed along the line of men until everyone reaches point B.

  • Answered by AI

Interview Preparation Tips

Skills: Algorithm, Javascript
College Name: na

Skills evaluated in this interview

Interview Preparation Tips

Skill Tips: To crack Yatra interview Java, Data Structures and Algorithms concepts should be clear.
Skills: Java, Data structures, Algorithm
College Name: na

I was interviewed before Feb 2021.

Round 1 - Coding Test 

(3 Questions)

Round duration - 90 minutes
Round difficulty - Medium

Questions on aptitude, English, logical reasoning, C/C++ and 5 coding ques. (only pseudo code).

  • Q1. 

    Minimum Jumps Problem Statement

    Bob and his wife are in the famous 'Arcade' mall in the city of Berland. This mall has a unique way of moving between shops using trampolines. Each shop is laid out in a st...

  • Ans. 

    Find the minimum number of trampoline jumps Bob needs to make to reach the final shop, or return -1 if it's impossible.

    • Use Breadth First Search (BFS) algorithm to find the minimum number of jumps required.

    • Keep track of the visited shops to avoid revisiting them.

    • If a shop has an Arr value of 0, it is impossible to reach the final shop.

    • Return -1 if the final shop cannot be reached.

  • Answered by AI
  • Q2. 

    Smallest Window Problem Statement

    Given two strings, S and X, your task is to find the smallest substring in S that contains all the characters present in X.

    Example:

    Input:
    S = "abdd", X = "bd"
    Outpu...
  • Ans. 

    Find the smallest substring in S that contains all characters in X.

    • Use a sliding window approach to find the smallest window in S containing all characters of X.

    • Maintain a hashmap to keep track of characters in X and their frequencies in the current window.

    • Slide the window to the right, updating the hashmap and shrinking the window until all characters in X are present.

    • Return the smallest window found.

    • Example: S = 'abd

  • Answered by AI
  • Q3. 

    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 start to destination.

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

    • Keep track of visited cells to avoid revisiting them.

    • Return paths in alphabetical order as a list of strings.

  • Answered by AI
Round 2 - Face to Face 

(3 Questions)

Round duration - 60 minutes
Round difficulty - Easy

Questions based on OOPS were asked in this round.

  • Q1. What is a virtual function?
  • Ans. 

    A virtual function is a function in a base class that is declared using the keyword 'virtual' and can be overridden by a function with the same signature in a derived class.

    • Virtual functions allow for dynamic polymorphism in C++

    • They are used in inheritance to achieve runtime polymorphism

    • Virtual functions are declared in a base class and can be overridden in derived classes

    • They are called based on the type of object bei...

  • Answered by AI
  • Q2. What are the types of polymorphism in Object-Oriented Programming?
  • Ans. 

    Types of polymorphism in OOP include compile-time (method overloading) and runtime (method overriding) polymorphism.

    • Compile-time polymorphism is achieved through method overloading, where multiple methods have the same name but different parameters.

    • Runtime polymorphism is achieved through method overriding, where a subclass provides a specific implementation of a method that is already defined in its superclass.

    • Polymor...

  • Answered by AI
  • Q3. What is the difference between deep copy and shallow copy?
  • Ans. 

    Deep copy creates a new object and recursively copies all nested objects, while shallow copy creates a new object and copies only the references to nested objects.

    • Deep copy creates a new object and copies all nested objects, while shallow copy creates a new object and copies only the references to nested objects.

    • In deep copy, changes made to the original object do not affect the copied object, while in shallow copy, ch...

  • Answered by AI
Round 3 - HR 

Round duration - 30 minutes
Round difficulty - Easy

HR round with typical behavioral problems.

Interview Preparation Tips

Eligibility criteriaAbove 7 CGPAMakeMyTrip interview preparation:Topics to prepare for the interview - Data Structures, Algorithms, System Design, Aptitude, OOPSTime required to prepare for the interview - 5 monthsInterview preparation tips for other job seekers

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.

Application resume tips for other job seekers

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.

Final outcome of the interviewSelected

Skills evaluated in this interview

I was interviewed in Dec 2016.

Interview Questionnaire 

1 Question

  • Q1. Tell me about yourself tell me about your internship My interview was unstructured(i.e based on your reply interviewer was asking Questions)

Interview Preparation Tips

Round: Test
Experience: Questions were very difficult and solving one Question gets you shortlisted for interview
I don't remember the Questions
Duration: 1 hour 30 minutes
Total Questions: 2

Skills: Internship Work, Inter Person Communication Skills
College Name: IIT Roorkee

I was interviewed before Feb 2021.

Round 1 - Coding Test 

(1 Question)

Round duration - 65 minutes
Round difficulty - Easy

There were 2 sections – 
Aptitude and Logical Reasoning and MCQ based on Java question ,C++, coding for 20 min and 45 min respectively.
Section A- Not very difficult to clear this round although less time was a problem.
Section B- It contains 15 multiple choice question on c/c++,java and 4 simple coding questions

  • Q1. 

    Cycle Detection in a Singly Linked List

    Determine if a given singly linked list of integers forms a cycle or not.

    A cycle in a linked list occurs when a node's next points back to a previous node in the ...

  • Ans. 

    Detect if a singly linked list forms a cycle by checking if a node's next pointer points back to a previous node.

    • Traverse the linked list using two pointers, one moving at double the speed of the other.

    • If the two pointers meet at any point, there is a cycle in the linked list.

    • Use Floyd's Cycle Detection Algorithm for O(N) time complexity and O(1) space complexity.

  • Answered by AI
Round 2 - Coding Test 

(3 Questions)

Round duration - 75 minutes
Round difficulty - Medium

It was an online coding test in which 3 coding question were given.

  • Q1. 

    Smallest Window Problem Statement

    Given two strings, S and X, your task is to find the smallest substring in S that contains all the characters present in X.

    Example:

    Input:
    S = "abdd", X = "bd"
    Outpu...
  • Ans. 

    Find the smallest substring in string S that contains all characters in string X.

    • Iterate through string S and keep track of characters in X found in a window

    • Use two pointers to maintain the window and slide it to find the smallest window

    • Return the smallest window containing all characters in X

  • Answered by AI
  • Q2. 

    Smallest Integer Not Representable as Subset Sum

    Given a non-decreasing sorted array ARR of N positive numbers, determine the smallest positive integer that cannot be expressed as the sum of elements from...

  • Ans. 

    Find the smallest positive integer that cannot be expressed as the sum of elements from any proper subset of a non-decreasing sorted array of positive numbers.

    • Start with the smallest possible integer that cannot be represented, which is 1.

    • Iterate through the array and update the smallest integer that cannot be represented.

    • If the current element is greater than the smallest integer that cannot be represented, return tha...

  • Answered by AI
  • Q3. 

    Minimum Steps for a Knight to Reach Target

    Given a square chessboard of size 'N x N', determine the minimum number of moves a Knight requires to reach a specified target position from its initial position...

  • Ans. 

    Calculate the minimum number of moves a Knight needs to reach a target position on a chessboard.

    • Implement a function that takes knight's starting position, target position, and chessboard size as input

    • Use breadth-first search algorithm to find the shortest path for the Knight

    • Consider all possible 8 movements of the Knight on the chessboard

    • Return the minimum number of moves required for the Knight to reach the target po

  • Answered by AI
Round 3 - Face to Face 

(4 Questions)

Round duration - 60 minutes
Round difficulty - Easy

It started with a discussion on the programs given in coding round. They asked me about my interest field after that they directly jumped into Networking, Linux and Ethical Hacking part looking my interest domain. They asked me various question on networking and linux.
Then they asked me to code a simple c program

  • Q1. 

    Reverse Linked List Problem Statement

    Given a singly linked list of integers, return the head of the reversed linked list.

    Example:

    Initial linked list: 1 -> 2 -> 3 -> 4 -> NULL
    Reversed link...
  • Ans. 

    Reverse a singly linked list of integers and return the head of the reversed linked list.

    • Iterate through the linked list and reverse the pointers to point to the previous node.

    • Keep track of the current, previous, and next nodes while reversing the linked list.

    • Update the head of the reversed linked list as the last node encountered during reversal.

  • Answered by AI
  • Q2. What are the port numbers of protocols such as FTP and SMTP?
  • Ans. 

    FTP uses port number 21 and SMTP uses port number 25.

    • FTP uses port 21 for data transfer and port 20 for control information.

    • SMTP uses port 25 for email communication.

    • Understanding port numbers is important for network communication.

  • Answered by AI
  • Q3. Can you explain the OSI Model?
  • Ans. 

    The OSI Model is a conceptual framework that standardizes the functions of a telecommunication or computing system into seven layers.

    • The OSI Model stands for Open Systems Interconnection Model.

    • It consists of seven layers: Physical, Data Link, Network, Transport, Session, Presentation, and Application.

    • Each layer has specific functions and communicates with the adjacent layers.

    • Example: Layer 1 (Physical) deals with physi...

  • Answered by AI
  • Q4. How do you copy files in Linux?
  • Ans. 

    To copy files in Linux, you can use the 'cp' command.

    • Use the 'cp' command followed by the source file and destination directory to copy a file.

    • To copy a directory and its contents, use the '-r' flag with the 'cp' command.

    • You can also use wildcards like '*' to copy multiple files at once.

  • Answered by AI

Interview Preparation Tips

Eligibility criteriaAbove 7 CGPAMakeMyTrip interview preparation:Topics to prepare for the interview - Data Structures, Algorithms, System Design, Aptitude, OOPSTime required to prepare for the interview - 4 monthsInterview preparation tips for other job seekers

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.

Application resume tips for other job seekers

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.

Final outcome of the interviewSelected

Skills evaluated in this interview

Interview Questionnaire 

8 Questions

  • Q1. Find out the subset of an array of continuous positive numbers from a larger array whose sum of of the elements is larger in comparision to other subset. eg: {1,2 5 -7, 2 5} .The two subarrays are {1,2,5} ...
  • Ans. 

    Find the subset of an array with the largest sum of continuous positive numbers.

    • Iterate through the array and keep track of the current sum and the maximum sum seen so far.

    • If the current element is positive, add it to the current sum. If it is negative, reset the current sum to 0.

    • Also keep track of the start and end indices of the maximum sum subset.

    • Return the subset using the start and end indices.

  • Answered by AI
  • Q2. Given two classes C1 and C2 which are almost same.(remember not exactly same). You want to choose best among these classes so that it can be use as key in hashmap. What question will you ask regarding two ...
  • Q3. You are given two strings s1 and s2.Now, find the smallest substring in s1 containing all characters of s2
  • Ans. 

    Find smallest substring in s1 containing all characters of s2.

    • Create a hash table of characters in s2

    • Use sliding window technique to find smallest substring in s1

    • Check if all characters in s2 are present in the substring

    • Update the smallest substring if a smaller one is found

  • Answered by AI
  • Q4. Questions on OOPS (almost all the concepts were covered like polymorphism, overriding, overloading, inheritance, concept of virtual fxns etc.)
  • Q5. Write algo for reversing a linked list
  • Ans. 

    Algorithm to reverse a linked list

    • Create a new empty linked list

    • Traverse the original linked list and insert each node at the beginning of the new list

    • Return the new list

  • Answered by AI
  • Q6. What is lazy loading? Advantages and disadvantages of the same?
  • Ans. 

    Lazy loading is a technique used to defer the loading of non-critical resources until they are needed.

    • Advantages: faster initial page load, reduced bandwidth usage, improved user experience

    • Disadvantages: increased complexity, potential for slower subsequent page loads, difficulty with SEO

    • Examples: images, videos, and other media files can be loaded only when they are visible on the screen

  • Answered by AI
  • Q7. How ajax works? Difference between angular js and jquery?
  • Ans. 

    Ajax is a technique for creating fast and dynamic web pages. AngularJS is a framework for building dynamic web applications, while jQuery is a library for simplifying HTML DOM traversal and manipulation.

    • Ajax stands for Asynchronous JavaScript and XML

    • It allows web pages to be updated asynchronously by exchanging data with a web server behind the scenes

    • AngularJS is a JavaScript framework that extends HTML with new attrib...

  • Answered by AI
  • Q8. Design a traffic light system?
  • Ans. 

    A traffic light system controls the flow of traffic at intersections.

    • The system consists of three lights: red, yellow, and green.

    • Each light has a specific duration for which it stays on.

    • The system also includes sensors to detect the presence of vehicles and pedestrians.

    • The duration of each light can be adjusted based on traffic patterns.

    • The system can be connected to a central control system for remote monitoring and m

  • Answered by AI

Interview Preparation Tips

Skills: Javascript, Ajax, Angular JS, Jquery
College Name: na

Skills evaluated in this interview

Contribute & help others!
anonymous
You can choose to be anonymous

Recently Viewed

PHOTOS

InsuranceDekho

3 office photos

LIST OF COMPANIES

Credit Bajaar

Overview

JOBS

Air India

No Jobs

SALARIES

BHEL

JOBS

Sterling Holiday Resort

No Jobs

JOBS

Safran Engineering Services India

No Jobs

INTERVIEWS

Oyo Rooms

No Interviews

SALARIES

BHEL

JOBS

Cube Consultancy Services

No Jobs

JOBS

Caslon Corporation

No Jobs

Tell us how to improve this page.

Interview Questions from Similar Companies

MakeMyTrip Interview Questions
3.7
 • 122 Interviews
Burger King Interview Questions
3.8
 • 69 Interviews
Hyatt Regency Interview Questions
4.1
 • 43 Interviews
Pizza Hut Interview Questions
3.9
 • 41 Interviews
JW Marriott Interview Questions
4.2
 • 39 Interviews
View all
Oyo Rooms Software Developer Intern Salary
based on 10 salaries
₹7.2 L/yr - ₹12.5 L/yr
65% more than the average Software Developer Intern Salary in India
View more details

Oyo Rooms Software Developer Intern Reviews and Ratings

based on 4 reviews

3.3/5

Rating in categories

3.3

Skill development

2.3

Work-life balance

3.8

Salary

1.3

Job security

2.0

Company culture

1.6

Promotions

2.3

Work satisfaction

Explore 4 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