Zomato coding interview
questions, leaked.
24 problems reported across recent Zomato interviews. Top patterns: array, dynamic programming, matrix. The list below is what most reported candidates actually saw, plus the honest play if you can't grind all of it.
Zomato's assessment hits you with 24 problems split roughly half medium, half hard. Arrays dominate 83% of the test, which means you're not solving 24 different patterns, you're solving arrays in every flavor: with dynamic programming, with hash tables, with matrices, with prefix sums. The math and bit-manipulation curveballs sit on top. If you blank on a matrix-DP hybrid or a number-theory constraint mid-assessment, StealthCoder runs invisible to the proctor and surfaces a working solution in seconds. You have a week. You can't out-grind the list above.
Top problems at Zomato
| # | Problem | Diff | Frequency | Pass % | Patterns |
|---|---|---|---|---|---|
| 01 | Split the Array to Make Coprime Products | HARD | 100.0 | 28% | Array · Hash Table · Math |
| 02 | Shortest Cycle in a Graph | HARD | 100.0 | 37% | Breadth-First Search · Graph |
| 03 | Bitwise OR of All Subsequence Sums | MEDIUM | 100.0 | 65% | Array · Math · Bit Manipulation |
| 04 | Number of Ways to Divide a Long Corridor | HARD | 100.0 | 49% | Math · String · Dynamic Programming |
| 05 | Maximum Spending After Buying Items | HARD | 100.0 | 60% | Array · Greedy · Sorting |
| 06 | Count the Hidden Sequences | MEDIUM | 94.3 | 57% | Array · Prefix Sum |
| 07 | Find and Replace Pattern | MEDIUM | 82.2 | 77% | Array · Hash Table · String |
| 08 | Total Cost to Hire K Workers | MEDIUM | 82.2 | 43% | Array · Two Pointers · Heap (Priority Queue) |
| 09 | Cherry Pickup | HARD | 76.5 | 38% | Array · Dynamic Programming · Matrix |
| 10 | Count Zero Request Servers | MEDIUM | 69.2 | 34% | Array · Hash Table · Sliding Window |
| 11 | First Missing Positive | HARD | 69.2 | 41% | Array · Hash Table |
| 12 | Snakes and Ladders | MEDIUM | 58.9 | 48% | Array · Breadth-First Search · Matrix |
| 13 | 3Sum | MEDIUM | 58.9 | 37% | Array · Two Pointers · Sorting |
| 14 | Number of Islands | MEDIUM | 58.9 | 62% | Array · Depth-First Search · Breadth-First Search |
| 15 | LFU Cache | HARD | 58.9 | 47% | Hash Table · Linked List · Design |
| 16 | Self Crossing | HARD | 58.9 | 32% | Array · Math · Geometry |
| 17 | Largest Rectangle in Histogram | HARD | 58.9 | 47% | Array · Stack · Monotonic Stack |
| 18 | Optimal Account Balancing | HARD | 58.9 | 50% | Array · Dynamic Programming · Backtracking |
| 19 | Frog Jump | HARD | 58.9 | 47% | Array · Dynamic Programming |
| 20 | Unique Paths II | MEDIUM | 58.9 | 43% | Array · Dynamic Programming · Matrix |
| 21 | Unique Paths | MEDIUM | 58.9 | 66% | Math · Dynamic Programming · Combinatorics |
| 22 | Two Sum II - Input Array Is Sorted | MEDIUM | 58.9 | 63% | Array · Two Pointers · Binary Search |
| 23 | Jump Game II | MEDIUM | 58.9 | 42% | Array · Dynamic Programming · Greedy |
| 24 | Maximum Subarray | MEDIUM | 58.9 | 52% | Array · Divide and Conquer · Dynamic Programming |
Frequencies derived from public community-tagged interview reports. Click a row to view on LeetCode.
You have a week, maybe less. You can't out-grind the list above. StealthCoder runs invisibly during the actual Zomato OA. The proctor cannot see it. Screen share cannot detect it. Built by an engineer who got tired of watching his cohort grind for six months and still get filtered at the OA stage.
Get StealthCoder- array20 · 83%
- dynamic programming8 · 33%
- matrix5 · 21%
- hash table5 · 21%
- math5 · 21%
- breadth first search3 · 13%
- two pointers3 · 13%
- sorting3 · 13%
- prefix sum2 · 8%
- string2 · 8%
Start with arrays. Twenty problems use them, so you're safer drilling "Cherry Pickup" and "Maximum Spending After Buying Items" than anything niche. Dynamic programming appears in 8 problems and often overlaps with arrays, so pair DP drills with your array work. Hash tables and math each show up in 5 problems, mostly as secondary topics glued to arrays. Breadth-first search, two-pointers, and sorting each account for 3 problems and feel like tiebreakers in the second half of the test. The hard problems cluster around hidden constraints: "First Missing Positive" (array plus hash table cleverness), "Split the Array to Make Coprime Products" (number theory under arrays), "Shortest Cycle in a Graph" (graph traversal with a twist). Zomato's test rewards pattern recognition over depth. StealthCoder is your hedge for the one problem that looks unfamiliar at 45 minutes in.
Companies with similar patterns
If you prepped for Zomato, these companies recycle ~60% of the same topics.
You've seen the list.
Now make sure you pass Zomato.
Memorizing every problem above in a week is a fantasy. StealthCoder is the hedge: an AI overlay that's invisible during screen share. It reads the problem on screen and surfaces a working solution in under 2 seconds. Built by an engineer who got tired of watching his cohort grind for six months and still get filtered at the OA stage. Works on HackerRank, CodeSignal, CoderPad, and Karat.
Zomato interview FAQ
How many array problems should I drill before the Zomato assessment?+
All of them. Arrays account for 20 of 24 problems. Drill "Cherry Pickup", "Maximum Spending After Buying Items", "First Missing Positive", and "Count Zero Request Servers" first, then loop back to easier array patterns. You need muscle memory on array iteration, indexing, and bounds checking under pressure.
Is dynamic programming required for Zomato or just helpful?+
Required for the hard tier. DP appears in 8 problems, often layered with arrays and matrices. "Number of Ways to Divide a Long Corridor" and "Cherry Pickup" are DP gatekeepers. If you haven't solved matrix DP before, dedicate 3-4 hours here. It's the difference between 15 minutes and blanking.
What should I study first, math or bit manipulation?+
Math. It appears in 5 problems and sits inside array problems as a hidden constraint. "Split the Array to Make Coprime Products" is a number-theory trap wrapped in an array question. Bit manipulation also appears in 2 problems but feels less central. Math first, bit tricks last.
Will drilling graph traversal (BFS, DFS) help for Zomato?+
Minimally. BFS appears in 3 problems, DFS in fewer. "Number of Islands" and "Snakes and Ladders" are your only major graph drills. If you're short on time, skip deep graph study. Arrays and DP are the time investment that pays.
How should I handle the 11 hard problems in limited prep time?+
Focus on the hard problems that are also array problems: "First Missing Positive", "Cherry Pickup", "Maximum Spending After Buying Items", and "Split the Array to Make Coprime Products". These 4 teach you 90% of what you'll see. The other hard problems (graph, cache design) are less likely to appear on assessment day.