How often are these problems asked?
Frequency scores are based on crowdsourced interview reports. A higher score means the problem has been reported more often in recent Zepto interviews.
Very Likely
75-100%
Likely
50-74%
Sometimes
25-49%
Rare
0-24%
Problem database last updated: June 20, 2025
31 problems · 1 Easy, 25 Medium, 5 Hard · Ranked #62 of 458
1 Easy
3% · avg 23%
25 Medium
81% · avg 59%
5 Hard
16% · avg 18%
Based on 31 reported problems, Zepto interviews are in line with industry averages - 16% Hard vs 18% overall. The majority (81%) 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, Zepto puts unusual emphasis on union-find (9.7% of problems, 3.3x the industry average), monotonic-stack (9.7% of problems, 3.3x the industry average), depth-first-search (19.4% of problems, 2.1x the industry average). If you're short on time, these are the categories to double down on.
The most common topics are array (77.4%), depth-first-search (19.4%), hash-table (19.4%), dynamic-programming (19.4%). Problems below are sorted by frequency, the ones at the top are asked most often.
| Problem | Difficulty | Frequency | Topics | |
|---|---|---|---|---|
Longest Univalue Path Given the root of a binary tree, return the length of the longest path, where each node in the path has the same value. This path may or may not pass through th... | Medium | Very Likely | treedepth-first-searchbinary-tree | Solve |
Merge Intervals Given an array of intervals where intervals[i] = [starti, endi], merge all overlapping intervals, and return an array of the non-overlapping intervals that cove... | Medium | Very Likely | arraysorting | Solve |
Path Sum III Given the root of a binary tree and an integer targetSum, return the number of paths where the sum of the values along the path equals targetSum. | Medium | Very Likely | treedepth-first-searchbinary-tree | Solve |
Car Pooling There is a car with capacity empty seats. The vehicle only drives east (i.e., it cannot turn around and drive west). | Medium | Very Likely | arraysortingheap-priority-queue | Solve |
Longest Consecutive Sequence Given an unsorted array of integers nums, return the length of the longest consecutive elements sequence. | Medium | Very Likely | arrayhash-tableunion-find | Solve |
Find Peak Element A peak element is an element that is strictly greater than its neighbors. | Medium | Very Likely | arraybinary-search | Solve |
Koko Eating Bananas Koko loves to eat bananas. There are n piles of bananas, the ith pile has piles[i] bananas. The guards have gone and will come back in h hours. | Medium | Very Likely | arraybinary-search | 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 | Very Likely | arraystackmonotonic-stack | Solve |
Sliding Window Maximum You are given an array of integers nums, there is a sliding window of size k which is moving from the very left of the array to the very right. You can only see... | Hard | Very Likely | arrayqueuesliding-window | Solve |
Minimum Cost For Tickets You have planned some train traveling one year in advance. The days of the year in which you will travel are given as an integer array days. Each day is an inte... | Medium | Very Likely | arraydynamic-programming | 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 |
Word Search Given an m x n grid of characters board and a string word, return true if word exists in the grid. | Medium | Likely | arraystringbacktracking | 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 |
Rotting Oranges You are given an m x n grid where each cell can have one of three values: | Medium | Likely | arraybreadth-first-searchmatrix | Solve |
LRU Cache Design a data structure that follows the constraints of a Least Recently Used (LRU) cache. | Medium | Likely | hash-tablelinked-listdesign | Solve |
Search in Rotated Sorted Array There is an integer array nums sorted in ascending order (with distinct values). | Medium | Likely | arraybinary-search | Solve |
Maximum Good Subarray Sum You are given an array nums of length n and a positive integer k. | Medium | Likely | arrayhash-tableprefix-sum | Solve |
Find the Distance Value Between Two Arrays Given two integer arrays arr1 and arr2, and the integer d, return the distance value between the two arrays. | Easy | Likely | arraytwo-pointersbinary-search | Solve |
Gas Station There are n gas stations along a circular route, where the amount of gas at the ith station is gas[i]. | Medium | Likely | arraygreedy | Solve |
Open the Lock You have a lock in front of you with 4 circular wheels. Each wheel has 10 slots: '0', '1', '2', '3', '4', '5', '6', '7', '8', '9'. The wheels can rotate freely... | Medium | Likely | arrayhash-tablestring | Solve |
Longest Repeating Character Replacement You are given a string s and an integer k. You can choose any character of the string and change it to any other uppercase English character. You can perform th... | Medium | Likely | hash-tablestringsliding-window | Solve |
Rabbits in Forest There is a forest with an unknown number of rabbits. We asked n rabbits "How many other rabbits have the same color as you?" and collected the answers in an int... | Medium | Likely | arrayhash-tablemath | Solve |
Count Sub Islands You are given two m x n binary matrices grid1 and grid2 containing only 0's (representing water) and 1's (representing land). An island is a group of 1's connec... | Medium | Likely | arraydepth-first-searchbreadth-first-search | Solve |
Trapping Rain Water Given n non-negative integers representing an elevation map where the width of each bar is 1, compute how much water it can trap after raining. | Hard | Likely | arraytwo-pointersdynamic-programming | Solve |
Next Permutation A permutation of an array of integers is an arrangement of its members into a sequence or linear order. | Medium | Likely | arraytwo-pointers | Solve |
Maximum Sum BST in Binary Tree Given a binary tree root, return the maximum sum of all keys of any sub-tree which is also a Binary Search Tree (BST). | Hard | Likely | dynamic-programmingtreedepth-first-search | Solve |
Longest Palindromic Substring Given a string s, return the longest palindromic substring in s. | Medium | Likely | two-pointersstringdynamic-programming | Solve |
Maximum Width Ramp A ramp in an integer array nums is a pair (i, j) for which i < j and nums[i] <= nums[j]. The width of such a ramp is j - i. | Medium | Likely | arraytwo-pointersstack | 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 |
Divide Two Integers Given two integers dividend and divisor, divide two integers without using multiplication, division, and mod operator. | Medium | Likely | mathbit-manipulation | Solve |
Make Array Empty You are given an integer array nums containing distinct numbers, and you can perform the following operations until the array is empty: | Hard | Likely | arraybinary-searchgreedy | Solve |
Longest Univalue Path
SolveGiven the root of a binary tree, return the length of the longest path, where each node in the path has the same value. This path may or may not pass through th...
Merge Intervals
SolveGiven an array of intervals where intervals[i] = [starti, endi], merge all overlapping intervals, and return an array of the non-overlapping intervals that cove...
Path Sum III
SolveGiven the root of a binary tree and an integer targetSum, return the number of paths where the sum of the values along the path equals targetSum.
Car Pooling
SolveThere is a car with capacity empty seats. The vehicle only drives east (i.e., it cannot turn around and drive west).
Longest Consecutive Sequence
SolveGiven an unsorted array of integers nums, return the length of the longest consecutive elements sequence.
Find Peak Element
SolveA peak element is an element that is strictly greater than its neighbors.
Koko Eating Bananas
SolveKoko loves to eat bananas. There are n piles of bananas, the ith pile has piles[i] bananas. The guards have gone and will come back in h hours.
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...
Sliding Window Maximum
SolveYou are given an array of integers nums, there is a sliding window of size k which is moving from the very left of the array to the very right. You can only see...
Minimum Cost For Tickets
SolveYou have planned some train traveling one year in advance. The days of the year in which you will travel are given as an integer array days. Each day is an inte...
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...
Word Search
SolveGiven an m x n grid of characters board and a string word, return true if word exists in the grid.
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.
Rotting Oranges
SolveYou are given an m x n grid where each cell can have one of three values:
LRU Cache
SolveDesign a data structure that follows the constraints of a Least Recently Used (LRU) cache.
Search in Rotated Sorted Array
SolveThere is an integer array nums sorted in ascending order (with distinct values).
Maximum Good Subarray Sum
SolveYou are given an array nums of length n and a positive integer k.
Find the Distance Value Between Two Arrays
SolveGiven two integer arrays arr1 and arr2, and the integer d, return the distance value between the two arrays.
Gas Station
SolveThere are n gas stations along a circular route, where the amount of gas at the ith station is gas[i].
Open the Lock
SolveYou have a lock in front of you with 4 circular wheels. Each wheel has 10 slots: '0', '1', '2', '3', '4', '5', '6', '7', '8', '9'. The wheels can rotate freely...
Longest Repeating Character Replacement
SolveYou are given a string s and an integer k. You can choose any character of the string and change it to any other uppercase English character. You can perform th...
Rabbits in Forest
SolveThere is a forest with an unknown number of rabbits. We asked n rabbits "How many other rabbits have the same color as you?" and collected the answers in an int...
Count Sub Islands
SolveYou are given two m x n binary matrices grid1 and grid2 containing only 0's (representing water) and 1's (representing land). An island is a group of 1's connec...
Trapping Rain Water
SolveGiven n non-negative integers representing an elevation map where the width of each bar is 1, compute how much water it can trap after raining.
Next Permutation
SolveA permutation of an array of integers is an arrangement of its members into a sequence or linear order.
Maximum Sum BST in Binary Tree
SolveGiven a binary tree root, return the maximum sum of all keys of any sub-tree which is also a Binary Search Tree (BST).
Longest Palindromic Substring
SolveGiven a string s, return the longest palindromic substring in s.
Maximum Width Ramp
SolveA ramp in an integer array nums is a pair (i, j) for which i < j and nums[i] <= nums[j]. The width of such a ramp is j - i.
Jump Game II
SolveYou are given a 0-indexed array of integers nums of length n. You are initially positioned at index 0.
Divide Two Integers
SolveGiven two integers dividend and divisor, divide two integers without using multiplication, division, and mod operator.
Make Array Empty
SolveYou are given an integer array nums containing distinct numbers, and you can perform the following operations until the array is empty:
Frequency scores are based on crowdsourced interview reports. A higher score means the problem has been reported more often in recent Zepto interviews.
Very Likely
75-100%
Likely
50-74%
Sometimes
25-49%
Rare
0-24%
Zepto interviews focus heavily on array, depth-first-search, 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. Zepto 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.
Zepto has been reported to ask 31 distinct coding problems. The most common topics are array, depth-first-search, hash-table. 1 are Easy difficulty, 25 are Medium, and 5 are Hard. Problems are sorted by frequency - the ones at the top are asked most often.
Based on 31 reported problems, Zepto interviews are in line with industry averages - 16% Hard vs 18% overall. 81% 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, depth-first-search, 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 Zepto coding interview with an AI interviewer. Get a scorecard with specific feedback on your problem-solving, code quality, and communication.
Simulate a Zepto interview with AIarrow_forward