i
Zomato
Filter interviews by
posted on 24 May 2017
I was interviewed in Jul 2016.
I applied via Campus Placement and was interviewed before Aug 2021. There were 3 interview rounds.
1 hour round, DSA questions on stacks and hash maps
1 hr round, DSA Q's and Puzzle
What people are saying about Zomato
posted on 15 Feb 2022
It was a 60 min coding test, with 2 dsa questions.
posted on 23 Dec 2020
Yes, high and low level design principles are important in software development.
High level design principles focus on overall architecture and system organization.
Low level design principles focus on implementation details and code structure.
Examples of high level design principles include SOLID, DRY, and KISS.
Examples of low level design principles include naming conventions, code commenting, and code formatting.
Both ...
posted on 3 Dec 2015
posted on 3 Dec 2015
posted on 23 Jan 2017
I was interviewed before Jan 2016.
posted on 15 May 2017
I was interviewed before May 2016.
Program to calculate sum of level order tree
Traverse the tree level by level using BFS
Add the values of each level and return the sum
Use a queue to store the nodes at each level
Handle edge cases like empty tree or null root
posted on 19 May 2017
I was interviewed in Aug 2016.
Find the length of longest increasing subsequence in an array.
Use dynamic programming to solve the problem efficiently.
Maintain an array to store the length of longest increasing subsequence ending at each index.
Traverse the array and update the array for each index.
Return the maximum value in the array as the length of longest increasing subsequence.
Find maximum of every window of size K in an array
Iterate through the array and maintain a deque of indices of elements in the current window
Remove indices from the front of the deque if they are outside the current window
Remove indices from the back of the deque if their corresponding elements are smaller than the current element
The front of the deque will always contain the index of the maximum element in the current
Implement binary search in a semi-infinite array.
Start with the first element and keep doubling the index until the target element is less than the current element.
Perform binary search on the subarray from the last doubled index to the current index.
If the target element is not found, repeat the process by doubling the last index and searching again.
Handle edge cases where the target element is at the first index or n
based on 3 reviews
Rating in categories
Delivery Boy
1k
salaries
| ₹0.4 L/yr - ₹5.4 L/yr |
Key Account Manager
902
salaries
| ₹4.5 L/yr - ₹14.2 L/yr |
Business Analyst
516
salaries
| ₹5 L/yr - ₹16 L/yr |
Accounts Manager
297
salaries
| ₹4 L/yr - ₹13.2 L/yr |
Senior Associate
274
salaries
| ₹3.2 L/yr - ₹11 L/yr |
Swiggy
Amazon
Dunzo
Flipkart