Filter interviews by
Be the first one to contribute and help others!
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 applied via Naukri.com and was interviewed in May 2019. There were 4 interview rounds.
Yes, I am comfortable traveling for work.
I have experience traveling for work in my previous roles.
I am adaptable and enjoy exploring new places.
I am willing to travel for client meetings and conferences.
I understand the importance of face-to-face interactions in sales.
I am organized and can handle the logistics of travel efficiently.
I applied via Recruitment Consultant and was interviewed in Jun 2020. There was 1 interview round.
I applied via Walk-in and was interviewed before Feb 2021. There were 3 interview rounds.
I applied via LinkedIn and was interviewed before May 2020. There was 1 interview round.
I appeared for an interview in Nov 2020.
I appeared for an interview before Sep 2020.
Round duration - 60 Minutes
Round difficulty - Easy
A thief is planning to rob a store and can carry a maximum weight of 'W' in his knapsack. The store contains 'N' items where the ith item has a weight of 'wi' and a value of...
Yes, the 0/1 Knapsack problem can be solved using dynamic programming with a space complexity of not more than O(W).
Use a 1D array to store the maximum value that can be stolen for each weight capacity from 0 to W.
Iterate through each item and update the array based on whether including the item would increase the total value.
The final value in the array at index W will be the maximum value that can be stolen.
Given an array or list of integers 'ARR', identify the second largest element in 'ARR'.
If a second largest element does not exist, return -1.
ARR = [2,...
Find the second largest element in an array of integers.
Iterate through the array to find the largest and second largest elements.
Handle cases where all elements are identical.
Return -1 if a second largest element does not exist.
Round duration - 60 Minutes
Round difficulty - Easy
System Design Round
Design a scalable system for Twitter with key components and architecture.
Use microservices architecture for scalability and fault isolation.
Key components include user service, tweet service, timeline service, and notification service.
Use a distributed database like Cassandra for storing tweets and user data.
Implement a message queue like Kafka for handling real-time updates and notifications.
Use a caching layer like ...
Round duration - 30 Minutes
Round difficulty - Easy
It is just a formality
Tip 1 : System Design
Tip 2 : Practice questions from leetcode
Tip 3 : Have some projects.
Tip 1 : Mention what you know
Tip 2 : Good previous work to showcase
I applied via Naukri.com and was interviewed before May 2023. There was 1 interview round.
25 basic aptitude asked from train,time and work
2 coding questions which was basic and medium questions
based on 1 interview
Interview experience
based on 9 reviews
Rating in categories
Store Manager
4
salaries
| ₹1.8 L/yr - ₹2.2 L/yr |
Area Sales Manager
3
salaries
| ₹4 L/yr - ₹9 L/yr |
Sales Manager
3
salaries
| ₹1.8 L/yr - ₹4.5 L/yr |
Store Keeper
3
salaries
| ₹2.2 L/yr - ₹2.2 L/yr |
Area Operation Manager
3
salaries
| ₹4.2 L/yr - ₹6.3 L/yr |
Monginis Foods
Theobroma Foods
Karachi Bakery
Bread Talk