Problem database last updated: June 20, 2025
22 problems · 0 Easy, 12 Medium, 10 Hard · Ranked #86 of 458
0 Easy
0% · avg 23%
12 Medium
55% · avg 59%
10 Hard
45% · avg 18%
Based on 22 reported problems, Zomato interviews are significantly harder than average - 45% Hard vs 18% across all companies. The majority (55%) of questions are Medium difficulty, which is typical for companies that want to see solid fundamentals without excessive trick questions.
Compared to the industry average, Zomato puts unusual emphasis on matrix (22.7% of problems, 2.6x the industry average), dynamic-programming (31.8% of problems, 1.6x the industry average), breadth-first-search (13.6% of problems, 1.6x the industry average). If you're short on time, these are the categories to double down on.
The most common topics are array (81.8%), dynamic-programming (31.8%), hash-table (22.7%), matrix (22.7%). Problems below are sorted by frequency, the ones at the top are asked most often.
| Problem | Difficulty | Frequency | Topics | |
|---|---|---|---|---|
Split the Array to Make Coprime Products You are given a 0-indexed integer array nums of length n. | Hard | Very Likely | arrayhash-tablemath | Solve |
Number of Ways to Divide a Long Corridor Along a long library corridor, there is a line of seats and decorative plants. You are given a 0-indexed string corridor of length n consisting of letters 'S' a... | Hard | Very Likely | mathstringdynamic-programming | Solve |
Shortest Cycle in a Graph There is a bi-directional graph with n vertices, where each vertex is labeled from 0 to n - 1. The edges in the graph are represented by a given 2D integer arra... | Hard | Very Likely | breadth-first-searchgraph | Solve |
Maximum Spending After Buying Items You are given a 0-indexed m n integer matrix values, representing the values of m n different items in m different shops. Each shop has n items where the jth it... | Hard | Very Likely | arraygreedysorting | Solve |
Total Cost to Hire K Workers You are given a 0-indexed integer array costs where costs[i] is the cost of hiring the ith worker. | Medium | Very Likely | arraytwo-pointersheap-priority-queue | Solve |
Find and Replace Pattern Given a list of strings words and a string pattern, return a list of words[i] that match pattern. You may return the answer in any order. | Medium | Very Likely | arrayhash-tablestring | Solve |
Cherry Pickup You are given an n x n grid representing a field of cherries, each cell is one of three possible integers. | Hard | Very Likely | arraydynamic-programmingmatrix | Solve |
First Missing Positive Given an unsorted integer array nums. Return the smallest positive integer that is not present in nums. | Hard | Likely | arrayhash-table | Solve |
Count Zero Request Servers You are given an integer n denoting the total number of servers and a 2D 0-indexed integer array logs, where logs[i] = [serverid, time] denotes that the server... | Medium | Likely | arrayhash-tablesliding-window | Solve |
Frog Jump A frog is crossing a river. The river is divided into some number of units, and at each unit, there may or may not exist a stone. The frog can jump on a stone,... | Hard | Likely | arraydynamic-programming | Solve |
3Sum Given an integer array nums, return all the triplets [nums[i], nums[j], nums[k]] such that i != j, i != k, and j != k, and nums[i] + nums[j] + nums[k] == 0. | Medium | Likely | arraytwo-pointerssorting | Solve |
Self Crossing You are given an array of integers distance. | Hard | Likely | arraymathgeometry | Solve |
Maximum Subarray Given an integer array nums, find the subarray with the largest sum, and return its sum. | Medium | Likely | arraydivide-and-conquerdynamic-programming | Solve |
Unique Paths There is a robot on an m x n grid. The robot is initially located at the top-left corner (i.e., grid[0][0]). The robot tries to move to the bottom-right corner... | Medium | Likely | mathdynamic-programmingcombinatorics | Solve |
Jump Game II You are given a 0-indexed array of integers nums of length n. You are initially positioned at index 0. | Medium | Likely | arraydynamic-programminggreedy | Solve |
Largest Rectangle in Histogram Given an array of integers heights representing the histogram's bar height where the width of each bar is 1, return the area of the largest rectangle in the his... | Hard | Likely | arraystackmonotonic-stack | Solve |
Unique Paths II You are given an m x n integer array grid. There is a robot initially located at the top-left corner (i.e., grid[0][0]). The robot tries to move to the bottom-r... | Medium | Likely | arraydynamic-programmingmatrix | Solve |
Number of Islands Given an m x n 2D binary grid grid which represents a map of '1's (land) and '0's (water), return the number of islands. | Medium | Likely | arraydepth-first-searchbreadth-first-search | Solve |
Snakes and Ladders You are given an n x n integer matrix board where the cells are labeled from 1 to n2 in a Boustrophedon style starting from the bottom left of the board (i.e. b... | Medium | Likely | arraybreadth-first-searchmatrix | Solve |
LFU Cache Design and implement a data structure for a Least Frequently Used (LFU) cache. | Hard | Likely | hash-tablelinked-listdesign | Solve |
Two Sum II - Input Array Is Sorted Given a 1-indexed array of integers numbers that is already sorted in non-decreasing order, find two numbers such that they add up to a specific target number.... | Medium | Likely | arraytwo-pointersbinary-search | Solve |
Split the Array to Make Coprime Products
SolveYou are given a 0-indexed integer array nums of length n.
Number of Ways to Divide a Long Corridor
SolveAlong a long library corridor, there is a line of seats and decorative plants. You are given a 0-indexed string corridor of length n consisting of letters 'S' a...
Shortest Cycle in a Graph
SolveThere is a bi-directional graph with n vertices, where each vertex is labeled from 0 to n - 1. The edges in the graph are represented by a given 2D integer arra...
Maximum Spending After Buying Items
SolveYou are given a 0-indexed m n integer matrix values, representing the values of m n different items in m different shops. Each shop has n items where the jth it...
Count the Hidden Sequences
SolveYou are given a 0-indexed array of n integers differences, which describes the differences between each pair of consecutive integers of a hidden sequence of len...
Total Cost to Hire K Workers
SolveYou are given a 0-indexed integer array costs where costs[i] is the cost of hiring the ith worker.
Find and Replace Pattern
SolveGiven a list of strings words and a string pattern, return a list of words[i] that match pattern. You may return the answer in any order.
Cherry Pickup
SolveYou are given an n x n grid representing a field of cherries, each cell is one of three possible integers.
First Missing Positive
SolveGiven an unsorted integer array nums. Return the smallest positive integer that is not present in nums.
Count Zero Request Servers
SolveYou are given an integer n denoting the total number of servers and a 2D 0-indexed integer array logs, where logs[i] = [serverid, time] denotes that the server...
Frog Jump
SolveA frog is crossing a river. The river is divided into some number of units, and at each unit, there may or may not exist a stone. The frog can jump on a stone,...
3Sum
SolveGiven an integer array nums, return all the triplets [nums[i], nums[j], nums[k]] such that i != j, i != k, and j != k, and nums[i] + nums[j] + nums[k] == 0.
Maximum Subarray
SolveGiven an integer array nums, find the subarray with the largest sum, and return its sum.
Unique Paths
SolveThere is a robot on an m x n grid. The robot is initially located at the top-left corner (i.e., grid[0][0]). The robot tries to move to the bottom-right corner...
Jump Game II
SolveYou are given a 0-indexed array of integers nums of length n. You are initially positioned at index 0.
Largest Rectangle in Histogram
SolveGiven an array of integers heights representing the histogram's bar height where the width of each bar is 1, return the area of the largest rectangle in the his...
Unique Paths II
SolveYou are given an m x n integer array grid. There is a robot initially located at the top-left corner (i.e., grid[0][0]). The robot tries to move to the bottom-r...
Number of Islands
SolveGiven an m x n 2D binary grid grid which represents a map of '1's (land) and '0's (water), return the number of islands.
Snakes and Ladders
SolveYou are given an n x n integer matrix board where the cells are labeled from 1 to n2 in a Boustrophedon style starting from the bottom left of the board (i.e. b...
LFU Cache
SolveDesign and implement a data structure for a Least Frequently Used (LFU) cache.
Two Sum II - Input Array Is Sorted
SolveGiven a 1-indexed array of integers numbers that is already sorted in non-decreasing order, find two numbers such that they add up to a specific target number....
Frequency scores are based on crowdsourced interview reports. A higher score means the problem has been reported more often in recent Zomato interviews.
Very Likely
75-100%
Likely
50-74%
Sometimes
25-49%
Rare
0-24%
Zomato interviews focus heavily on array, dynamic-programming, hash-table problems. If you're short on time, these are the categories to prioritize. The problems on this page are sorted by frequency, so start from the top and work your way down.
Beyond solving problems, practice explaining your approach. Zomato interviewers care about your thought process - how you break down a problem, consider edge cases, and evaluate tradeoffs between solutions. A clean O(n) solution you can explain clearly beats an O(log n) solution you can't articulate.
Looking for more companies? Browse all 458 companies in our directory, or sharpen your fundamentals with our free data structure visualizers and AI-powered DSA tutor.
Zomato has been reported to ask 22 distinct coding problems. The most common topics are array, dynamic-programming, hash-table. 0 are Easy difficulty, 12 are Medium, and 10 are Hard. Problems are sorted by frequency - the ones at the top are asked most often.
Based on 22 reported problems, Zomato interviews are significantly harder than average - 45% Hard vs 18% across all companies. 55% of questions are Medium difficulty. Focus on the high-frequency Medium problems first, then work through the Hard ones.
Start with the highest-frequency problems listed on this page. Focus on the core topics: array, dynamic-programming, hash-table. Practice solving them under time pressure and explaining your approach out loud. Mock interviews with AI can simulate the real experience.
Simulate a real Zomato coding interview with an AI interviewer. Get a scorecard with specific feedback on your problem-solving, code quality, and communication.
Simulate a Zomato interview with AIarrow_forward
