i
Zomato
Filter interviews by
I applied via Referral and was interviewed in May 2024. There was 1 interview round.
By transparently communicating the reasons behind the decrease and involving the team in finding solutions, trust and understanding can be built.
Explain the reasons behind the decrease in order payment, such as changes in market demand or company financial constraints.
Involve the team in brainstorming solutions to mitigate the impact of the decrease, such as optimizing routes or increasing efficiency.
Provide regular up...
I applied via Job Fair and was interviewed in May 2024. There was 1 interview round.
I applied via Referral and was interviewed in Aug 2023. There were 3 interview rounds.
Handling fleet strikes requires effective communication, strategic planning, and quick decision-making.
Establish clear communication channels with drivers and fleet managers
Develop a contingency plan for strike situations
Monitor fleet operations closely to identify any potential issues
Work with legal team to ensure compliance with labor laws
Consider alternative transportation options if necessary
What people are saying about Zomato
I applied via LinkedIn and was interviewed in Oct 2021. There were 4 interview rounds.
I implement process changes by analyzing current processes, identifying areas for improvement, creating a plan, and communicating changes to stakeholders.
Analyze current processes to identify areas for improvement
Create a plan for implementing changes
Communicate changes to stakeholders and provide training if necessary
Monitor and evaluate the effectiveness of the changes
Make adjustments as needed to ensure success
Examp...
Approximately 36-40 delivery partners are needed to deliver 5000 orders/week with 10 hours log in per day.
Assuming each delivery partner can deliver 10-15 orders per day
Considering 6 working days per week
Taking into account factors like traffic, distance, and delivery time
May require additional delivery partners during peak seasons or holidays
Excess delivery partners needed next week due to order growth, dip in delivery partners, and rejoinings.
Calculate the number of orders for next week after 20% growth.
Calculate the number of delivery partners for next week after 20% dip and 10% rejoinings.
Subtract the number of delivery partners for next week from the number of orders for next week.
The result is the number of excess delivery partners needed for next wee
Zomato interview questions for designations
I applied via Referral and was interviewed before Nov 2021. There were 3 interview rounds.
I applied via Referral and was interviewed in Jul 2023. There were 2 interview rounds.
Logical Questions regarding brain game.
I applied via Referral and was interviewed before May 2023. There were 2 interview rounds.
English test and reasoning
I applied via Company Website and was interviewed in Aug 2020. There was 1 interview round.
I appeared for an interview before Sep 2020.
Round duration - 90 Minutes
Round difficulty - Medium
This is a written round on paper for everyone. Three coding questions were given. Two out of three must be correct covering every single edge case to qualify for the next round. Only the most optimal solution was to be considered.
Given an array ARR
consisting of N
integers, your goal is to determine the maximum possible sum of a non-empty contiguous subarray within this array.
Find the maximum sum of a contiguous subarray in an array of integers.
Use Kadane's algorithm to find the maximum subarray sum in linear time.
Initialize two variables: maxSum and currentSum.
Iterate through the array and update currentSum by adding the current element or starting a new subarray.
Update maxSum if currentSum becomes greater than maxSum.
Return maxSum as the maximum subarray sum.
Round duration - 50 Minutes
Round difficulty - Easy
This was face to face interview round.
You are given a Binary Tree of integers and an integer 'X'. Your task is to find all the triplets in the tree whose sum is strictly greater than 'X'. Th...
Find all triplets in a binary tree whose sum is greater than a given integer X, with a grandparent-parent-child relationship.
Traverse the binary tree to find all possible triplets.
Check if the sum of each triplet is greater than X.
Ensure the relationship of grandparent-parent-child in each triplet.
Return the valid triplets in any order.
Handle constraints and edge cases appropriately.
Round duration - 60 Minutes
Round difficulty - Easy
FACE TO FACE ROUND INTERVIEW
Mutex is used for exclusive access to a resource by only one thread at a time, while Semaphores can allow multiple threads to access a resource simultaneously.
Mutex is binary and allows only one thread to access a resource at a time, while Semaphores can have a count greater than one.
Mutex is used for protecting critical sections of code, while Semaphores can be used for controlling access to a pool of resources.
Exampl...
Tip 1 : Participate in previous interview questions from leetcode, geeksforgeeks
Tip 2 : Revise computer science subjects like dbms and oops thoroughly
Tip 3 : Participate in live contests on CodeChef, Codeforces
Tip 1 : Only write the things on which you are the most confident about
Final outcome of the interviewRejectedI appeared for an interview before Sep 2020.
Round duration - 60 minutes
Round difficulty - Easy
There was 2 coding questions
Based on ds and algorithms
Your task is to determine the minimum number of platforms required at a railway station so that no train has to wait.
Given two arrays:
AT
- represent...Determine the minimum number of platforms needed at a railway station so that no train has to wait.
Sort the arrival and departure times arrays in ascending order.
Initialize two pointers, one for arrival times and one for departure times.
Increment the platform count when a train arrives and decrement when it departs.
Keep track of the maximum platform count needed.
Return the maximum platform count as the minimum number o
Given a string S
of length N
, an array A
of length M
consisting of lowercase letters, and a positive integer K
, determine the minimum number of swaps r...
The minimum number of swaps required to make a string K-periodic by replacing characters with elements from an array.
Iterate through the string and check if each character matches the character K positions ahead.
Count the number of characters that need to be swapped to make the string K-periodic.
Use the array elements to swap characters in the string.
Return the total number of swaps needed for each test case.
Round duration - 45 minutes
Round difficulty - Medium
It was good round they asked me about all the ds and algo basics
With 2 problems by sharing the screeen
You are provided with a 2-dimensional matrix having N
rows and M
columns, containing only 1s (land) and 0s (water). Your goal is to determine the number of islands in t...
Count the number of islands in a 2D matrix of 1s and 0s.
Use Depth First Search (DFS) or Breadth First Search (BFS) to traverse the matrix and identify connected groups of 1s.
Maintain a visited array to keep track of visited cells to avoid redundant traversal.
Increment the island count each time a new island is encountered.
Consider all eight possible directions for connectivity while traversing the matrix.
Handle edge ca...
Given an array of integers with 'N' elements, determine the length of the longest subsequence where each element is greater than the previous element. This...
Find the length of the longest strictly increasing subsequence in an array of integers.
Use dynamic programming to solve this problem efficiently.
Initialize an array to store the length of the longest increasing subsequence ending at each index.
Iterate through the array and update the length of the longest increasing subsequence for each element.
Return the maximum value in the array as the result.
Round duration - 50 minutes
Round difficulty - Medium
In this round, three questions were asked and all of them were based on DSA and a little bit about projects.
Bob and his wife are in the famous 'Arcade' mall in the city of Berland. This mall has a unique way of moving between shops using trampolines. Each shop is laid out in a st...
Find the minimum number of jumps Bob needs to make from shop 0 to reach the final shop, or return -1 if impossible.
Use BFS to traverse through the shops and keep track of the minimum jumps required.
If at any point the current shop is unreachable (Arr[i] = 0), return -1.
Optimize by using a visited array to avoid revisiting the same shop.
Tip 1 : Be enough confident, don't be nervous. Maintain atleast 2 projects in your resume.
Tip 2 : You should be able to answer each and every thing present in your resume. Don't lie in your resume.
Tip 3 : Prepare Data Structures and Algorithms well. They mostly check our Problem Solving ability to find the solutions for the real world problems
Tip 1 : Build your resume such that it grabs the eye of the interviewer
Tip 2 : metion your key skills and also maintain atleast 2 projects
Some of the top questions asked at the Zomato Fleet Operations Manager interview -
based on 12 interviews
Interview experience
based on 30 reviews
Rating in categories
Key Account Manager
950
salaries
| ₹4.5 L/yr - ₹13.9 L/yr |
Delivery Boy
898
salaries
| ₹0.4 L/yr - ₹5.3 L/yr |
Business Analyst
578
salaries
| ₹5 L/yr - ₹15 L/yr |
Senior Associate
300
salaries
| ₹3 L/yr - ₹10 L/yr |
Accounts Manager
292
salaries
| ₹4 L/yr - ₹13.2 L/yr |
Swiggy
Amazon
Dunzo
Flipkart