i
Filter interviews by
Be the first one to contribute and help others!
I applied via Recruitment Consulltant and was interviewed in Oct 2022. There were 2 interview rounds.
posted on 20 Aug 2017
I appeared for an interview in Apr 2017.
I applied for this internship because I am passionate about gaining practical experience in the field and developing my skills.
Passionate about gaining practical experience
Desire to develop skills in the field
Opportunity to learn from professionals
Interest in the company's work and values
The newspaper contains news articles, opinion pieces, advertisements, and other information.
News articles covering current events
Opinion pieces discussing various topics
Advertisements for products and services
Sports section with updates on games and matches
Weather forecast for the day
Local events and community news
Business section with stock market updates
Entertainment section featuring movie reviews and celebrity news
I applied via Campus Placement
I applied via Campus Placement
I am a dedicated professional with experience in management. I want to work in Oyo for its innovative approach to hospitality. Life in Bangalore is vibrant and diverse.
I have a strong background in management and leadership roles
I am attracted to Oyo for its innovative technology-driven approach to hospitality
Bangalore offers a vibrant cultural scene with diverse food options and entertainment
The city is known for its
I applied via Referral and was interviewed before Oct 2020. There were 4 interview rounds.
IHG is a multinational hospitality company that owns and operates several hotel brands worldwide.
IHG stands for InterContinental Hotels Group
It was founded in 2003 and is headquartered in Denham, UK
IHG owns and operates several hotel brands including InterContinental, Crowne Plaza, Holiday Inn, and Kimpton Hotels & Restaurants
It has over 5,900 hotels in nearly 100 countries
IHG is one of the largest hotel companies in t
posted on 3 Dec 2020
I applied via Campus Placement and was interviewed before Dec 2019. There were 4 interview rounds.
I applied via Campus Placement and was interviewed before Nov 2020. There were 3 interview rounds.
I appeared for an interview before Sep 2020.
Round duration - 90 minutes
Round difficulty - Medium
You are given a matrix MAT
of size 'N' * 'M', where 'N' is the number of rows and 'M' is the number of columns, along with a positive integer 'K'. Your task is to rotate the ma...
Rotate a matrix to the right 'K' times by shifting each column to the right 'K' times.
Iterate 'K' times to perform right rotation on the matrix
Shift each column to the right by one position in each rotation
Handle wrapping around the matrix when shifting columns
Return the matrix elements row-wise after 'K' rotations
Given a two-dimensional grid of size N x M
consisting of upper case characters and a string 'WORD', determine how many times the 'WORD' appears in the grid.
The 'WORD' can b...
Count how many times a given word appears in a 2D grid by moving in any of the eight possible directions.
Iterate through each cell in the grid and check if the word can be formed starting from that cell in any of the eight directions.
Use recursion to explore all possible paths from a starting cell to form the word.
Keep track of visited cells to avoid revisiting the same cell in the same path.
Return the count of how man
Round duration - 75 minutes
Round difficulty - Medium
Interview started with an introduction and walk through the resume for first 5 minutes. After that, interview asked few coding questions.
You are provided with a non-empty grid consisting of only 0s and 1s. Your task is to determine the maximum area of an island within the given grid.
An island consists of a...
Find the maximum area of an island in a grid of 0s and 1s.
Iterate through the grid and perform depth-first search (DFS) to find connected 1s.
Keep track of the area of each island found and return the maximum area.
Consider all four directions (horizontal, vertical, and diagonal) while exploring the island.
Handle edge cases like grid boundaries and already visited cells during DFS.
If no island is present, return 0 as the
Determine if there exists a Pythagorean triplet within a given array of integers. A Pythagorean triplet consists of three numbers, x, y, and z, such that x^2 + y^2 = z^2.
Check if there exists a Pythagorean triplet in a given array of integers.
Iterate through all possible triplets in the array and check if they form a Pythagorean triplet.
Use a nested loop to generate all possible combinations of three numbers from the array.
Check if the sum of squares of two numbers is equal to the square of the third number.
Given a Binary Tree of integers, you are tasked with finding the top view of the binary tree. The top view is the set of nodes visible when the tree is viewed fro...
Find the top view of a Binary Tree by returning a list of visible nodes when viewed from the top.
Traverse the Binary Tree in level order and keep track of the horizontal distance of each node from the root.
Use a map to store the nodes at each horizontal distance, and only keep the topmost node for each horizontal distance.
Return the values of the topmost nodes in the map as the top view of the Binary Tree.
Round duration - 90 minutes
Round difficulty - Medium
This round was focused on DSA along with short discussion on computer science fundamentals. For coding problems, I was asked to code the first problem only. For others, had to discuss the approach only. For computer science fundamentals, discussion on OOPS. Differences between process and threads were discussed.
Given a Binary Search Tree (BST) where two nodes have been swapped by mistake, your task is to restore or fix the BST without changing its structure.
The first...
Restore a Binary Search Tree by fixing two swapped nodes without changing its structure.
Identify the two nodes that are swapped by mistake in the BST.
Swap the values of the two identified nodes to restore the BST.
Perform an in-order traversal of the BST to verify the correct restoration.
Ensure no extra space other than the recursion stack is used for the solution.
Your task is to implement a Stack data structure using a Singly Linked List.
Create a class named Stack
which supports the following operations, each in O(1...
Implement a Stack data structure using a Singly Linked List with operations like getSize, isEmpty, push, pop, and getTop in O(1) time.
Create a class named Stack with methods for getSize, isEmpty, push, pop, and getTop.
Use a Singly Linked List to store the elements of the stack.
Ensure that each operation runs in constant time O(1).
Handle edge cases like empty stack appropriately.
Test the implementation with sample queri
Tip 1 : Focus on DSA as you will be judged mostly on that for entry-level software engineer profiles.
Tip 2 : Don't mug up the solution as you might not be able to recall the approach or you might face new question that you haven't seen earlier.
Tip 3 : Practice as much as possible from platforms like InterviewBit, LeetCode.
Tip 1 : Try not to mention those things about which you are not comfortable.
Tip 2 : Having one or two good projects in resume helps.
Tip 3 : Mention good competitive programming ranks (if any)
Tip 4 : Use overleaf.com for making a resume using Latex.
based on 4 reviews
Rating in categories
Oyo Rooms
Mahindra Holidays & Resorts
Oberoi Group of Hotels
Hyatt Regency