DSA Doctor
Verified Company Vault
Zomato DSA Interview Questions
27 curated coding interview questions directly asked in Zomato technical rounds, sorted by frequency with recency and difficulty diagnostics.
27
Total Questions
2 (7%)
Easy Problems
16 (59%)
Medium Problems
9 (33%)
Hard Problems
🔥 Most Tested Topics:
Arrays (10)Core DSA (9)Graphs (3)Strings (3)Backtracking (2)
📂 Sourced Datasets:
All questionsOlder than 6 months
| ID | Problem | Difficulty | Topic | Pattern | Acceptance | Frequency | Recency |
|---|---|---|---|---|---|---|---|
| 2931 | Maximum Spending After Buying Items | Hard | Arrays | Sorting / Prefix / Scan | 61.1% | 100.0% | all |
| 2584 | Split the Array to Make Coprime Products | Hard | Arrays | Sorting / Prefix / Scan | 29.0% | 100.0% | all |
| 2505 | Bitwise OR of All Subsequence Sums | Medium | Arrays | Sorting / Prefix / Scan | 64.1% | 100.0% | all |
| 2608 | Shortest Cycle in a Graph | Hard | Graphs; Linked List | BFS / DFS / Topological Sort; Two Pointers | 39.6% | 100.0% | all |
| 2147 | Number of Ways to Divide a Long Corridor | Hard | Core DSA | Implementation / Reasoning | 54.6% | 100.0% | all |
| 2145 | Count the Hidden Sequences | Medium | Core DSA | Implementation / Reasoning | 56.8% | 87.5% | all |
| 41 | First Missing Positive | Hard | Arrays | Sorting / Prefix / Scan | 42.9% | 75.0% | all |
| 200 | Number of Islands | Medium | Graphs | BFS / DFS / Topological Sort | 64.4% | 75.0% | all |
| 3 | Longest Substring Without Repeating Characters | Medium | Strings; Trees | Hashing / Sliding Window; DFS / BFS; Sliding Window | 39.1% | 75.0% | all |
| 626 | Exchange Seats | Medium | Core DSA | Implementation / Reasoning | 74.2% | 75.0% | all |
| 15 | 3Sum | Medium | Arrays | Sorting / Prefix / Scan | 39.1% | 62.5% | all |
| 460 | LFU Cache | Hard | Design | Data Structure Design | 49.2% | 62.5% | all |
| 335 | Self Crossing | Hard | Core DSA | Implementation / Reasoning | 35.0% | 62.5% | all |
| 909 | Snakes and Ladders | Medium | Core DSA | Implementation / Reasoning | 48.1% | 62.5% | all |
| 53 | Maximum Subarray | Medium | Arrays | Sorting / Prefix / Scan | 53.3% | 62.5% | all |
| 260 | Single Number III | Medium | Core DSA | Implementation / Reasoning | 70.3% | 62.5% | all |
| 221 | Maximal Square | Medium | Core DSA | Implementation / Reasoning | 50.3% | 62.5% | all |
| 540 | Single Element in a Sorted Array | Medium | Arrays | Sorting / Prefix / Scan | 59.3% | 62.5% | all |
| 205 | Isomorphic Strings | Easy | Strings | Hashing / Sliding Window | 48.4% | 62.5% | all |
| 207 | Course Schedule | Medium | Graphs | BFS / DFS / Topological Sort | 51.4% | 62.5% | all |
| 358 | Rearrange String k Distance Apart | Hard | Strings | Hashing / Sliding Window | 40.0% | 62.5% | all |
| 218 | The Skyline Problem | Hard | Core DSA | Implementation / Reasoning | 45.4% | 62.5% | all |
| 46 | Permutations | Medium | Backtracking | Backtracking | 81.9% | 62.5% | all |
| 283 | Move Zeroes | Easy | Core DSA | Two Pointers | 63.8% | 62.5% | all |
| 39 | Combination Sum | Medium | Arrays; Backtracking | Sorting / Prefix / Scan; Backtracking | 76.5% | 62.5% | all |
| 240 | Search a 2D Matrix II | Medium | Arrays; Binary Search | Sorting / Prefix / Scan; Binary Search | 57.3% | 62.5% | all |
| 56 | Merge Intervals | Medium | Arrays | Sorting / Prefix / Scan | 51.8% | 62.5% | all |