i
Filter interviews by
I applied via Approached by Company and was interviewed in Jun 2023. There were 4 interview rounds.
Manager aptitude with situations based questions
Top trending discussions
I applied via Referral and was interviewed before Mar 2023. There was 1 interview round.
I have 5 years of experience in marketing, including developing marketing strategies, managing campaigns, and analyzing market trends.
Developed and implemented marketing strategies to increase brand awareness
Managed digital marketing campaigns across various platforms
Analyzed market trends and consumer behavior to optimize marketing efforts
Collaborated with cross-functional teams to execute marketing initiatives
Seeking new challenges and growth opportunities
Looking for a new challenge to further develop my skills and experience
Interested in taking on more responsibilities and advancing my career
Seeking a more supportive and collaborative work environment
Want to explore new industry or sector for personal growth
Previous organization lacked opportunities for career advancement
I applied via LinkedIn and was interviewed in Apr 2024. There were 2 interview rounds.
Dynamic professional with 7 years of experience in management, skilled in team leadership and project execution.
Background: I hold a degree in Business Administration from XYZ University.
Experience: Over 7 years in management roles, leading teams to achieve project goals.
Skills: Proficient in strategic planning and operational efficiency, demonstrated by a 20% increase in team productivity in my last role.
Leadership: S...
I would like to understand more about the company's culture and growth opportunities for the Deputy Manager role.
Can you describe the team dynamics and how collaboration is encouraged?
What are the key performance indicators for this role, and how is success measured?
Are there opportunities for professional development and training within the company?
How does the company support work-life balance for its employees?
What ...
I appeared for an interview in Jul 2024.
I have extensive experience in sales, focusing on building relationships and achieving targets through strategic planning and execution.
Developed and executed a sales strategy that increased revenue by 30% in one year.
Built strong relationships with clients, resulting in a 95% customer retention rate.
Conducted market research to identify new opportunities, leading to the successful launch of a new product line.
Trained ...
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.
based on 5 interview experiences
Difficulty level
Duration
based on 16 reviews
Rating in categories
5-12 Yrs
Not Disclosed
Relationship Manager
460
salaries
| ₹2.8 L/yr - ₹5.5 L/yr |
Assistant Manager
242
salaries
| ₹2.2 L/yr - ₹5 L/yr |
Senior Executive
166
salaries
| ₹2 L/yr - ₹4.2 L/yr |
Senior Territory Manager
111
salaries
| ₹4.1 L/yr - ₹8.5 L/yr |
Deputy Manager
110
salaries
| ₹3.8 L/yr - ₹6.6 L/yr |
Udaan
Swiggy
Oyo Rooms
Blinkit