Dunzo coding interview
questions, leaked.
8 problems reported across recent Dunzo interviews. Top patterns: dynamic programming, array, string. The list below is what most reported candidates actually saw, plus the honest play if you can't grind all of it.
Dunzo's coding assessment hits you with 8 problems, half of them hard. Dynamic programming dominates the list (5 of 8), almost always combined with arrays or strings. If you haven't drilled DP state transitions and multi-dimensional indexing recently, this interview will expose that gap fast. The good news: the pattern is predictable. The hedge: if you blank on a DP formulation mid-assessment, StealthCoder runs invisibly and surfaces a working approach in seconds, so you don't tank on a problem you'd normally solve given more time.
Top problems at Dunzo
| # | Problem | Diff | Frequency | Pass % | Patterns |
|---|---|---|---|---|---|
| 01 | Find All Good Strings | HARD | 100.0 | 44% | String · Dynamic Programming · String Matching |
| 02 | Number of Distinct Substrings in a String | MEDIUM | 100.0 | 65% | String · Trie · Rolling Hash |
| 03 | Number of Ways to Form a Target String Given a Dictionary | HARD | 100.0 | 57% | Array · String · Dynamic Programming |
| 04 | Stone Game VII | MEDIUM | 100.0 | 58% | Array · Math · Dynamic Programming |
| 05 | Ways to Make a Fair Array | MEDIUM | 100.0 | 65% | Array · Prefix Sum |
| 06 | Build Array Where You Can Find The Maximum Exactly K Comparisons | HARD | 100.0 | 67% | Dynamic Programming · Prefix Sum |
| 07 | Arithmetic Slices II - Subsequence | HARD | 63.4 | 55% | Array · Dynamic Programming |
| 08 | Count Complete Tree Nodes | EASY | 63.4 | 70% | Binary Search · Bit Manipulation · Tree |
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 Dunzo 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- dynamic programming5 · 63%
- array4 · 50%
- string3 · 38%
- prefix sum2 · 25%
- string matching1 · 13%
- trie1 · 13%
- rolling hash1 · 13%
- suffix array1 · 13%
- hash function1 · 13%
- math1 · 13%
Dunzo tests DP depth over breadth. Five problems require DP reasoning, four hit arrays, and three hit strings, often in combination. 'Find All Good Strings' and 'Number of Ways to Form a Target String Given a Dictionary' are the anchors: both merge string processing with DP state management. 'Arithmetic Slices II' and 'Build Array Where You Can Find The Maximum Exactly K Comparisons' push multi-dimensional DP indexing further. Start with array DP problems ('Ways to Make a Fair Array', 'Stone Game VII') to warm up, then lock into string-DP hybrids. Prefix-sum appears twice, which is quick yardage if you nail it. The hard problems are where most candidates crater: StealthCoder becomes your safety net here, turning a wall into a 30-second solve so you keep momentum through the full assessment.
Companies with similar patterns
If you prepped for Dunzo, these companies recycle ~60% of the same topics.
You've seen the list.
Now make sure you pass Dunzo.
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.
Dunzo interview FAQ
How many DP problems should I drill before a Dunzo interview?+
Dunzo has 5 DP problems out of 8 total. Drill at least 10-15 DP problems covering state transitions, multi-dimensional indexing, and string DP before the assessment. Focus on those that mix DP with arrays or strings, since that's Dunzo's pattern. You're looking for speed and confidence on substring/subsequence DP variants.
Is binary search enough for this interview?+
No. Only 1 of 8 problems mentions binary search, and it's on a different topic (tree traversal). Binary search is a rounding error here. Spend zero time on it. DP and arrays are where your prep time returns points.
What should I study first for Dunzo?+
Dynamic programming first. It appears in 5 of 8 problems, often paired with strings or arrays. After DP, drill array manipulation and string processing. Prefix-sum is a bonus if you have time, but DP fluency is non-negotiable. Skip game theory unless you love it; it's 1 problem.
How hard are Dunzo's problems compared to my prep?+
Half are hard (4 of 8). If you've drilled medium-tier DP before, medium problems here feel doable. The hard ones demand clean state definitions and tight implementation. You need to be comfortable coding a DP solution under pressure, not just understanding the idea.
Are string problems important for Dunzo?+
Yes. 3 of 8 problems are string-focused, and two of the hardest ones merge strings with DP. 'Find All Good Strings' is the hardest string-DP hybrid you might face. If strings feel weak, drill substring and subsequence DP patterns now. String matching and rolling hash show up once each; lower priority than core DP.