Zomato Coding Interview Questions
We track 27 coding questions asked at Zomato, tagged with the algorithms and concepts they test. The most common: Array, Hash Table, Matrix, Breadth-First Search, Sorting.
Browse all 27 Zomato questions →Concept mix
Each question's weight is split evenly across its concepts, so the shares sum to 100%.
- Array27.9%
- Hash Table8.6%
- Matrix4.9%
- Breadth-First Search4.8%
- Sorting4.3%
- String4.3%
- Two Pointers4.3%
- Binary Search4.0%
- Dynamic Programming3.7%
- Backtracking3.7%
- Other (21)29.5%
How many questions involve each concept
Share of all 27 tracked Zomato questions that touch each concept. Questions usually involve several, so these overlap.
- Array74.1%
- Hash Table22.2%
- Matrix18.5%
- Breadth-First Search14.8%
- Sorting14.8%
- Binary Search11.1%
- Divide and Conquer11.1%
- Dynamic Programming11.1%
- Math11.1%
- String11.1%
- Two Pointers11.1%
- Backtracking7.4%
Where Zomato differs from the average company
Concept weight at Zomato relative to the average across all companies we track. Green means Zomato leans on it harder than most.
- Divide and Conquer3.3×
- Backtracking2.8×
- Graph Theory2.8×
- Breadth-First Search2.2×
- Depth-First Search0.74×
- Math0.61×
- Dynamic Programming0.60×
- String0.45×
Zomato specialties
Concepts that show up at Zomato but are rarely asked elsewhere. They are easy to get blindsided by.
Difficulty mix
Level split of the 27 tracked Zomato questions.
- Junior11% (3)
- Mid/Senior59% (16)
- Staff30% (8)
Every concept in Zomato interviews
| Concept | Questions | % of questions | Share of mix |
|---|---|---|---|
| Array | 20 | 74.1% | 27.9% |
| Hash Table | 6 | 22.2% | 8.6% |
| Matrix | 5 | 18.5% | 4.9% |
| Breadth-First Search | 4 | 14.8% | 4.8% |
| Sorting | 4 | 14.8% | 4.3% |
| Binary Search | 3 | 11.1% | 4.0% |
| Divide and Conquer | 3 | 11.1% | 2.6% |
| Dynamic Programming | 3 | 11.1% | 3.7% |
| Math | 3 | 11.1% | 3.4% |
| String | 3 | 11.1% | 4.3% |
| Two Pointers | 3 | 11.1% | 4.3% |
| Backtracking | 2 | 7.4% | 3.7% |
| Depth-First Search | 2 | 7.4% | 1.7% |
| Graph Theory | 2 | 7.4% | 2.8% |
| Heap (Priority Queue) | 2 | 7.4% | 1.2% |
| Binary Indexed Tree | 1 | 3.7% | 0.5% |
| Bit Manipulation | 1 | 3.7% | 1.9% |
| Database | 1 | 3.7% | 3.7% |
| Design | 1 | 3.7% | 0.9% |
| Doubly-Linked List | 1 | 3.7% | 0.9% |
| Geometry | 1 | 3.7% | 1.2% |
| Greedy | 1 | 3.7% | 0.7% |
| Sweep Line | 1 | 3.7% | 0.5% |
| Linked List | 1 | 3.7% | 0.9% |
| Number Theory | 1 | 3.7% | 0.9% |
| Ordered Set | 1 | 3.7% | 0.5% |
| Prefix Sum | 1 | 3.7% | 1.9% |
| Segment Tree | 1 | 3.7% | 0.5% |
| Sliding Window | 1 | 3.7% | 1.2% |
| Topological Sort | 1 | 3.7% | 0.9% |
| Union-Find | 1 | 3.7% | 0.7% |
Practice a Zomato interview
Take a realistic AI-led mock interview with questions Zomato actually asks, with live voice and real feedback.
Start a mock interviewYour first interview is free · no credit card required