Zomato's DSA rounds mix classic data-structure fundamentals (trees, arrays, sliding window) with occasional harder graph/DP combinations, and interviewers frequently follow up by changing a constraint mid-problem (e.g., "what if the array had negative numbers?") to see how you adapt. The three problems below are real, recently reported (2025) Zomato questions with full solutions.
Given an array containing n distinct numbers taken from the range 1 to n+1 (i.e., exactly one number from 1..n+1 is missing), find the missing number.
Input: nums = [1, 2, 4, 5]
Output: 3
Input: nums = [2, 3, 1, 5]
Output: 4
Given an array of positive integers and a target sum, find the length of the shortest contiguous subarray whose sum is greater than or equal to the target. Return 0 if no such subarray exists. Be ready to discuss how the approach changes if the array can contain negative numbers.
Input: target = 7, nums = [2, 3, 1, 2, 4, 3]
Output: 2
The subarray [4, 3] has sum 7 and is the shortest one meeting the target.
Given the root of a binary search tree and a key, delete the node with that key from the tree and return the new root, preserving the BST property. Handle all three cases: the node is a leaf, has one child, or has two children.
Input: root = [5,3,6,2,4,null,7], key = 3
Output: [5,4,6,2,null,null,7] (one valid answer — either the in-order predecessor or successor may replace the deleted node)
More DSA questions Zomato has asked recently
These topics were reported in verified 2025 Zomato interviews. Full problem statements, solutions and explanations for these are part of the Placement-Ready PYQ Kit.
5 more verified DSA questions with full solutions in the full Placement-Ready PYQ Kit
Includes every round they were asked in, from on-campus single-round loops to off-campus interviews.