Filter interviews by
I applied via Job Fair and was interviewed before May 2023. There was 1 interview round.
Top trending discussions
I applied via Referral and was interviewed before Jan 2019. There were 3 interview rounds.
I applied via Referral and was interviewed before Feb 2021. There were 2 interview rounds.
I expect a competitive salary that reflects my experience and the responsibilities of the Team Leader role.
Research industry standards: For example, similar roles in our region typically offer between $70,000 and $90,000.
Consider my experience: With over 5 years in leadership positions, I believe a salary in the upper range is justified.
Emphasize value: I aim to bring innovative solutions and improve team performance, ...
I applied via LinkedIn and was interviewed before Jul 2021. There were 2 interview rounds.
I applied via Referral and was interviewed before Sep 2020. There was 1 interview round.
I successfully led projects that improved efficiency, increased sales, and enhanced team collaboration in my previous roles.
Increased sales by 20% in one year by implementing a new marketing strategy.
Led a team of 10 in a project that reduced operational costs by 15%.
Developed a training program that improved employee performance and satisfaction.
Successfully managed a cross-departmental initiative that streamlined com...
I applied via Referral and was interviewed before May 2020. There was 1 interview round.
To understand the supply of restaurants in a particular area of a city, we can use various methods.
Collect data from online directories like Yelp, Zomato, etc.
Conduct surveys to gather information about the number of restaurants in the area.
Analyze the population density and demographics of the area to estimate the demand for restaurants.
Check the number of restaurant permits issued by the local government.
Use GIS mapp...
I appeared for an interview in Jan 2021.
Round duration - 60 Minutes
Round difficulty - Easy
4 Questions which were of Easy, Medium, and Hard level.
The structure of a binary tree has been modified so that each node includes a reference to its parent node.
You are provided with two nodes,...
This question is about finding the lowest common ancestor of two nodes in a binary tree with parent references.
Traverse from the given nodes to their respective root nodes and store the paths in two separate lists.
Compare the two lists and find the last common node.
Return the last common node as the lowest common ancestor.
Ninja has been given an array, and he wants to find a subarray such that the sum of all elements in the subarray is maximum.
A subarray 'A' is considered greater than a...
The problem is to find a subarray with the maximum sum in a given array.
Iterate through the array and keep track of the maximum sum and the current sum.
If the current sum becomes negative, reset it to 0.
Update the maximum sum if the current sum is greater.
Also keep track of the start and end indices of the subarray with the maximum sum.
Return the subarray using the start and end indices.
Round duration - 50 Minutes
Round difficulty - Easy
Given a list of integers of size N
, your task is to determine the Next Greater Element (NGE) for every element. The Next Greater Element for an element X
is the firs...
The task is to find the next greater element for each element in an array.
Iterate through the array from right to left.
Use a stack to keep track of the elements that have a greater element to their right.
For each element, pop elements from the stack until a greater element is found or the stack is empty.
If a greater element is found, it is the next greater element for the current element.
If the stack becomes empty, the...
You are given a long type array/list ARR
of size N
, representing an elevation map. The value ARR[i]
denotes the elevation of the ith
bar. Your task is to determine th...
The question asks to find the total amount of rainwater that can be trapped in the given elevation map.
Iterate through the array and find the maximum height on the left and right side of each bar.
Calculate the amount of water that can be trapped at each bar by taking the minimum of the maximum heights on both sides and subtracting the height of the bar.
Sum up the amount of water trapped at each bar to get the total amo...
Round duration - 30 Minutes
Round difficulty - Easy
It is just a formality round, asked basic questions like relocation and joining date etc
Tip 1 : Be good with all data structures and algorithms
Tip 2 : Able to explain your projects well
Tip 3 : focus on basics
Tip 1 : Try to make a single-page resume.
Tip 2 : Don't write unnecessary details like hobbies, family, etc.
I applied via Naukri.com and was interviewed in Sep 2019. There were 4 interview rounds.
To increase business, focus on customer satisfaction, expand marketing efforts, and offer promotions.
Improve customer service to increase customer satisfaction and loyalty
Expand marketing efforts through social media, email marketing, and targeted advertising
Offer promotions such as discounts, referral programs, and loyalty rewards
Analyze market trends and adjust business strategies accordingly
Collaborate with other bu...
Solution to performing operations on a large array of bits.
Use bitwise operators to perform operations on individual bits
Use a loop to iterate through the array and perform the operations
Ensure that the array is large enough to accommodate all the bits
Consider using a data structure like a bitset for efficient bit manipulation
based on 1 interview experience
Difficulty level
Duration
based on 8 reviews
Rating in categories
Udaan
BigBasket
Swiggy
Oyo Rooms