Zepto coding interview
questions, leaked.
31 problems reported across recent Zepto interviews. Top patterns: array, depth first search, dynamic programming. The list below is what most reported candidates actually saw, plus the honest play if you can't grind all of it.
Zepto's coding interview hits you with 31 problems across their assessment, and 80% of them are medium difficulty. Arrays dominate the problem set (24 out of 31), followed by tree traversals, dynamic programming, and hash tables. You're not grinding a balanced problem mix here. The real depth is in patterns that work on arrays: sliding windows, two pointers, binary search, monotonic stacks. One easy problem won't save you. If you hit a wall on Sliding Window Maximum or Trapping Rain Water mid-assessment, StealthCoder runs invisibly and surfaces the approach in seconds, keeping you moving forward.
Top problems at Zepto
| # | Problem | Diff | Frequency | Pass % | Patterns |
|---|---|---|---|---|---|
| 01 | Longest Univalue Path | MEDIUM | 100.0 | 43% | Tree · Depth-First Search · Binary Tree |
| 02 | Path Sum III | MEDIUM | 100.0 | 46% | Tree · Depth-First Search · Binary Tree |
| 03 | Merge Intervals | MEDIUM | 100.0 | 49% | Array · Sorting |
| 04 | Car Pooling | MEDIUM | 93.4 | 56% | Array · Sorting · Heap (Priority Queue) |
| 05 | Sliding Window Maximum | HARD | 84.8 | 48% | Array · Queue · Sliding Window |
| 06 | Largest Rectangle in Histogram | HARD | 84.8 | 47% | Array · Stack · Monotonic Stack |
| 07 | Minimum Cost For Tickets | MEDIUM | 84.8 | 67% | Array · Dynamic Programming |
| 08 | Longest Consecutive Sequence | MEDIUM | 84.8 | 47% | Array · Hash Table · Union Find |
| 09 | Koko Eating Bananas | MEDIUM | 84.8 | 49% | Array · Binary Search |
| 10 | Find Peak Element | MEDIUM | 84.8 | 47% | Array · Binary Search |
| 11 | Trapping Rain Water | HARD | 72.8 | 65% | Array · Two Pointers · Dynamic Programming |
| 12 | Count Sub Islands | MEDIUM | 72.8 | 73% | Array · Depth-First Search · Breadth-First Search |
| 13 | Divide Two Integers | MEDIUM | 72.8 | 18% | Math · Bit Manipulation |
| 14 | Maximum Width Ramp | MEDIUM | 72.8 | 56% | Array · Two Pointers · Stack |
| 15 | Unique Paths II | MEDIUM | 72.8 | 43% | Array · Dynamic Programming · Matrix |
| 16 | Search in Rotated Sorted Array | MEDIUM | 72.8 | 43% | Array · Binary Search |
| 17 | Rabbits in Forest | MEDIUM | 72.8 | 58% | Array · Hash Table · Math |
| 18 | Longest Repeating Character Replacement | MEDIUM | 72.8 | 57% | Hash Table · String · Sliding Window |
| 19 | Make Array Empty | HARD | 72.8 | 25% | Array · Binary Search · Greedy |
| 20 | Find the Distance Value Between Two Arrays | EASY | 72.8 | 70% | Array · Two Pointers · Binary Search |
| 21 | Next Permutation | MEDIUM | 72.8 | 43% | Array · Two Pointers |
| 22 | LRU Cache | MEDIUM | 72.8 | 45% | Hash Table · Linked List · Design |
| 23 | Gas Station | MEDIUM | 72.8 | 46% | Array · Greedy |
| 24 | Open the Lock | MEDIUM | 72.8 | 61% | Array · Hash Table · String |
| 25 | Word Search | MEDIUM | 72.8 | 45% | Array · String · Backtracking |
| 26 | Maximum Sum BST in Binary Tree | HARD | 72.8 | 44% | Dynamic Programming · Tree · Depth-First Search |
| 27 | Jump Game II | MEDIUM | 72.8 | 42% | Array · Dynamic Programming · Greedy |
| 28 | Longest Palindromic Substring | MEDIUM | 72.8 | 36% | Two Pointers · String · Dynamic Programming |
| 29 | Rotting Oranges | MEDIUM | 72.8 | 57% | Array · Breadth-First Search · Matrix |
| 30 | Number of Islands | MEDIUM | 72.8 | 62% | Array · Depth-First Search · Breadth-First Search |
| 31 | Maximum Good Subarray Sum | MEDIUM | 72.8 | 20% | Array · Hash Table · Prefix Sum |
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 Zepto OA. The proctor cannot see it. Screen share cannot detect it. Built because the OA filter rejects engineers who'd pass the on-site. That's a broken filter. This is the workaround.
Get StealthCoder- array24 · 77%
- depth first search6 · 19%
- dynamic programming6 · 19%
- hash table6 · 19%
- binary search5 · 16%
- two pointers5 · 16%
- matrix5 · 16%
- sorting4 · 13%
- breadth first search4 · 13%
- greedy4 · 13%
The distribution is unmistakable: Zepto cares about array manipulation under constraints. Depth-first search, dynamic programming, and hash tables each appear in 6 problems, but they're almost always layered on top of array or matrix foundations. Sorting and two-pointer techniques unlock Merge Intervals and Maximum Width Ramp. Binary search appears in 5 problems, mostly as the vehicle for optimization (Koko Eating Bananas, Find Peak Element). Tree problems exist but feel secondary compared to the array gauntlet. Prioritize arrays, two pointers, and monotonic structures first. DP and DFS are your secondary focus. When you're prepping, you'll cycle through the same patterns repeatedly. That repetition is both your advantage and your risk: if a twist catches you off-guard during the live OA, StealthCoder is the safety net that lets you move to the next problem instead of burning 20 minutes on a variant you haven't drilled.
Companies with similar patterns
If you prepped for Zepto, these companies recycle ~60% of the same topics.
You've seen the list.
Now make sure you pass Zepto.
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 because the OA filter rejects engineers who'd pass the on-site. That's a broken filter. This is the workaround. Works on HackerRank, CodeSignal, CoderPad, and Karat.
Zepto interview FAQ
How many array problems should I solve before the Zepto OA?+
Arrays appear in 24 of 31 problems. Solve at least one problem each in sliding windows, two pointers, binary search, and monotonic stacks. Focus on Sliding Window Maximum, Trapping Rain Water, and Largest Rectangle in Histogram first. Those three alone cover the hardest array patterns you'll see.
Are tree problems worth drilling for Zepto?+
Trees account for only 3 problems. Longest Univalue Path and Path Sum III both use DFS. Learn DFS well because it also powers matrix traversals (Count Sub Islands), but don't spend your limited prep time on obscure tree variants. Array patterns matter more.
Should I study dynamic programming or binary search first for this company?+
Binary search is easier to master and appears in 5 problems. Start there: Koko Eating Bananas and Find Peak Element teach the core pattern. DP appears in 6 problems but often mixed with arrays (Unique Paths II, Minimum Cost For Tickets). Binary search is your faster win.
What's the difficulty spike I need to handle?+
Only 1 easy problem across 31. The jump to medium is steep. Hard problems (5 total) like Sliding Window Maximum and Trapping Rain Water involve monotonic stacks or multi-pointer logic. Expect no gimmes. Your prep should skip easy entirely and focus on medium patterns that hide hard edges.
Is hash table a priority for Zepto's interview?+
Hash tables appear in 6 problems, often supporting array or set-based logic (Longest Consecutive Sequence). Learn them, but they're rarely the main challenge. Arrays and two pointers dominate. Hash tables are the sidekick, not the star.