30+ Oyo Rooms Interview Questions and Answers for Freshers

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.

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

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 number of ways modulo 1000000007.

• Example: For 'N' = 2, valid se...read more

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.

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

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: For [3, 2, 7], the maximum sum would be 7 (3 + 7) as 3 and ...read more

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.

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 like when the value to make change for is 0.

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.

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.

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 elements of both heaps

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 distribution would be [1, 2, 1, 2, 3, 1] with a total of 1...read more

A computer is an electronic device that can perform various tasks by executing a set of instructions.

• Computer stands for 'Common Operating Machine Particularly Used for Technical and Educational Research'.

• It is a programmable machine that can store, retrieve, and process data.

• Computers can perform complex calculations, store large amounts of information, and communicate with other computers.

• Examples of computers include desktops, laptops, tablets, and smartphones.

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.

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-repeating character at that point in the stream.

• Return the first n...read more

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 0->1, 1->2, 2->0, a cycle exists among the vertices 0 -> ...read more

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.

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.

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.

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

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 minimum cost for each test case.

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.

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.

Filter in Excel is used to sort and display specific data based on certain criteria.

• Filter allows users to view a subset of data that meets specific conditions.

• It helps in analyzing and organizing large amounts of data.

• Filtering can be done based on text, numbers, dates, or custom criteria.

• Example: Filtering a sales data sheet to display only the transactions from a specific region.

• Example: Filtering a list of employees to show only those who have a certain job title.

Mail merge is a feature in word processing software that allows you to create personalized letters or emails using a template and a list of recipients.

• Mail merge is used to create personalized letters, envelopes, labels, and emails.

• It requires a template document and a data source, such as an Excel spreadsheet or a database.

• The data source contains the information that will be merged into the template, such as names and addresses.

• Mail merge can save time and effort when sendi...read more

A hyperlink is a clickable link that takes you to another webpage or a specific location on the same webpage.

• Hyperlinks are commonly used in websites to navigate between pages.

• They can also be used to link to external resources such as documents or videos.

• Hyperlinks are created using HTML code and can be styled to appear as text or images.

• They can be opened in the same window or a new window or tab.

• Hyperlinks can also be used in spreadsheets and other documents to link to oth...read more

Yes, I have deep knowledge of cooking different cuisines.

• I have experience cooking various cuisines such as Italian, Mexican, Chinese, and Indian.

• I am familiar with different cooking techniques and ingredients used in each cuisine.

• I enjoy experimenting with fusion dishes that combine elements from different cuisines.

• I keep up with current food trends and am always learning new recipes and techniques.

• I have received positive feedback from customers and colleagues on my ability...read more

Kolkata is a vibrant city located in eastern India, known for its rich history, culture, and cuisine.

• Kolkata was the capital of British India until 1911

• It is home to iconic landmarks such as Victoria Memorial and Howrah Bridge

• The city is famous for its street food, including puchkas and jhal muri

• Kolkata is also known for its literary and artistic heritage, with notable figures such as Rabindranath Tagore and Satyajit Ray hailing from the city