Filter interviews by
Clear (1)
I applied via Naukri.com and was interviewed in May 2022. There were 3 interview rounds.
Math Reasoning, Probability, Graph and pie charts, Indices, Trignometry, Geometry
Verbal communication and english speaking, grammer,
Top trending discussions
I applied via Campus Placement and was interviewed in Sep 2024. There were 3 interview rounds.
There were 3 coding questions totally based on dsa- hard
Use Dijkstra's algorithm to find the node with the shortest distance in a graph.
Implement Dijkstra's algorithm to calculate the shortest distance from a starting node to all other nodes in the graph.
Select the node with the smallest distance that has not been visited yet as the current node.
Update the distances of neighboring nodes from the current node if the new distance is smaller than the previously recorded distan...
I applied via Referral and was interviewed before Mar 2023. There were 2 interview rounds.
It was 1 hour long and was asked to pass all the test cases.
I applied via Campus Placement and was interviewed before Oct 2023. There was 1 interview round.
Dsa -> questions on trees, linked list, stack, dynamic programming
I applied via Campus Placement and was interviewed before Nov 2023. There were 2 interview rounds.
Leetcode medium to hard
I was interviewed in Oct 2024.
Polyfills,html,css basics,js intermediate level
I applied via Campus Placement and was interviewed before Dec 2021. There were 3 interview rounds.
Coding Rond consisted of 3 questions
I applied via Campus Placement and was interviewed in Sep 2022. There were 2 interview rounds.
3 data structure problem with medium to hard level leetcode type.
I was interviewed before Sep 2020.
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.
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 ...
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.
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.
Given an integer array/list ARR
of 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...
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.
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 ...
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...
Round duration - 45 minutes
Round difficulty - Easy
It was also a problem solving round. However after coding questions, they also asked CSE conceptual questions.
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...
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 queries
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
I applied via Recruitment Consulltant and was interviewed before Jan 2024. There was 1 interview round.
The assignment involved a train booking API. I needed to implement a feature that verified whether a train had sufficient available seats before confirming a booking, which would also resolve several failing tests. I was required to explain my thought process and describe the implementation as I progressed. Upon completion, with some extra time available, I proposed and implemented an improved solution: a new method that checks if a train has enough seats for a prospective booking while ensuring that families or groups who wish to stay together are not separated.
Food & Beverage Associate
48
salaries
| ₹0 L/yr - ₹0 L/yr |
Guest Service Associate
45
salaries
| ₹0 L/yr - ₹0 L/yr |
Front Office Associate
34
salaries
| ₹0 L/yr - ₹0 L/yr |
Food & Beverage Executive
29
salaries
| ₹0 L/yr - ₹0 L/yr |
Associate
26
salaries
| ₹0 L/yr - ₹0 L/yr |
Taj Hotels Resorts and Palaces
ITC Hotels
Hyatt Regency
Marriott International