Filter interviews by
I applied via Walk-in and was interviewed in Jul 2024. There was 1 interview round.
Growing trend tips regarding house charities, commission rate.
Top trending discussions
posted on 24 Dec 2024
I applied via Walk-in and was interviewed before Feb 2021. There were 3 interview rounds.
I applied via Referral and was interviewed before Apr 2021. There were 2 interview rounds.
How to maintain control spillage
F&V stages refer to the different stages of fruits and vegetables from harvesting to consumption.
The first stage is harvesting, where the produce is picked from the plant.
The second stage is grading, where the produce is sorted based on quality and size.
The third stage is packaging, where the produce is packed for transportation and storage.
The fourth stage is transportation, where the produce is transported to the mar...
I applied via Naukri.com
Sales is the process of persuading a potential customer to buy a product or service.
Sales involves identifying potential customers
Salespeople use various techniques to persuade customers to buy
Sales requires building relationships with customers
Sales involves meeting or exceeding sales targets
Sales can be done through various channels such as face-to-face, phone, or online
Sales is crucial for the success of a business
I applied via LinkedIn and was interviewed in Nov 2020. There were 3 interview rounds.
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 Recruitment Consultant and was interviewed in Feb 2021. There was 1 interview round.
I applied via Company Website and was interviewed in Jun 2021. There were 4 interview rounds.
based on 1 interview experience
Difficulty level
Customer experience Manager
63
salaries
| ₹3.9 L/yr - ₹9.3 L/yr |
Property Manager
57
salaries
| ₹1.5 L/yr - ₹4.2 L/yr |
MEP Engineer
52
salaries
| ₹2.7 L/yr - ₹5.1 L/yr |
Associate Manager
49
salaries
| ₹4 L/yr - ₹12 L/yr |
Operations Manager
39
salaries
| ₹2 L/yr - ₹9.2 L/yr |
CoLive
Nestaway
Udaan
Swiggy