Filter interviews by
I applied via LinkedIn and was interviewed before Mar 2023. There was 1 interview round.
Top trending discussions
I applied via Naukri.com
I applied via Approached by Company and was interviewed before Dec 2021. There was 1 interview round.
I applied via Naukri.com and was interviewed before Mar 2022. There were 2 interview rounds.
Our recruitment source mix consisted of various channels to attract a diverse pool of candidates.
We utilized online job boards such as LinkedIn, Indeed, and Glassdoor.
We also leveraged social media platforms like Facebook and Twitter to reach a wider audience.
Employee referrals played a significant role in our recruitment process.
We collaborated with universities and attended job fairs to connect with potential candida...
My name is John Smith. I enjoy playing guitar and reading books in my free time. I recently completed my Bachelor's degree in Business Administration.
My name is John Smith
Hobbies include playing guitar and reading books
Recently completed Bachelor's degree in Business Administration
posted on 23 Sep 2021
I applied via Recruitment Consultant and was interviewed in Aug 2021. There were 3 interview rounds.
Next greater element is a problem where we find the closest greater element for each element in an array.
Iterate through the array
For each element, compare it with the elements on its right
Find the first element greater than the current element
Store the result in a new array or data structure
Program to find all prime numbers up to given N.
Start with 2 and iterate up to N
For each number, check if it is divisible by any number from 2 to its square root
If not divisible, add it to the list of primes
Fetching unique URLs from a 10GB file with non-unique URLs.
Read the file in chunks to avoid memory issues.
Use a hash set to store unique URLs.
Iterate through each URL in the file and add it to the hash set if it doesn't already exist.
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 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 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
based on 1 interview
Interview experience
based on 4 reviews
Rating in categories
Cafe Manager
293
salaries
| ₹1.3 L/yr - ₹4.6 L/yr |
Assistant Manager
234
salaries
| ₹1 L/yr - ₹7.7 L/yr |
Territory Sales Manager
158
salaries
| ₹4.4 L/yr - ₹8.3 L/yr |
Brew Master
134
salaries
| ₹1 L/yr - ₹3.2 L/yr |
Senior Executive
112
salaries
| ₹1.8 L/yr - ₹7 L/yr |
Oyo Rooms
Jubilant Foods Works
Oberoi Group of Hotels
Marriott International