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 Dunzo interviews.
Very Likely
75-100%
Likely
50-74%
Sometimes
25-49%
Rare
0-24%
Problem database last updated: June 20, 2025
D
Dunzo Coding Interview Questions
7 problems · 1 Easy, 2 Medium, 4 Hard · Ranked #200 of 458
Difficulty breakdown
1 Easy
14% · avg 23%
2 Medium
29% · avg 59%
4 Hard
57% · avg 18%
Top topics
dynamic-programming
71.4%3.6x
array
57.1%
string
28.6%
prefix-sum
28.6%8.6x
string-matching
14.3%16.4x
math
14.3%
Interview profile
Based on 7 reported problems, Dunzo interviews are significantly harder than average - 57% Hard vs 18% across all companies.
Compared to the industry average, Dunzo puts unusual emphasis on prefix-sum (28.6% of problems, 8.6x the industry average), dynamic-programming (71.4% of problems, 3.6x the industry average). If you're short on time, these are the categories to double down on.
The most common topics are dynamic-programming (71.4%), array (57.1%), string (28.6%), prefix-sum (28.6%). Problems below are sorted by frequency, the ones at the top are asked most often.
All 7 problems
| Problem | Difficulty | Frequency | Topics | |
|---|---|---|---|---|
Number of Ways to Form a Target String Given a Dictionary You are given a list of strings of the same length words and a string target. | Hard | Very Likely | arraystringdynamic-programming | Solve |
Ways to Make a Fair Array You are given an integer array nums. You can choose exactly one index (0-indexed) and remove the element. Notice that the index of the elements may change after... | Medium | Very Likely | arrayprefix-sum | Solve |
Find All Good Strings Given the strings s1 and s2 of size n and the string evil, return the number of good strings. | Hard | Very Likely | stringdynamic-programmingstring-matching | Solve |
Stone Game VII Alice and Bob take turns playing a game, with Alice starting first. | Medium | Very Likely | arraymathdynamic-programming | Solve |
Build Array Where You Can Find The Maximum Exactly K Comparisons You are given three integers n, m and k. Consider the following algorithm to find the maximum element of an array of positive integers: | Hard | Very Likely | dynamic-programmingprefix-sum | Solve |
Arithmetic Slices II - Subsequence Given an integer array nums, return the number of all the arithmetic subsequences of nums. | Hard | Likely | arraydynamic-programming | Solve |
Count Complete Tree Nodes Given the root of a complete binary tree, return the number of the nodes in the tree. | Easy | Likely | binary-searchbit-manipulationtree | Solve |
Number of Ways to Form a Target String Given a Dictionary
SolveYou are given a list of strings of the same length words and a string target.
HardVery Likely
arraystringdynamic-programming
Ways to Make a Fair Array
SolveYou are given an integer array nums. You can choose exactly one index (0-indexed) and remove the element. Notice that the index of the elements may change after...
MediumVery Likely
arrayprefix-sum
Find All Good Strings
SolveGiven the strings s1 and s2 of size n and the string evil, return the number of good strings.
HardVery Likely
stringdynamic-programmingstring-matching
Stone Game VII
SolveAlice and Bob take turns playing a game, with Alice starting first.
MediumVery Likely
arraymathdynamic-programming
Build Array Where You Can Find The Maximum Exactly K Comparisons
SolveYou are given three integers n, m and k. Consider the following algorithm to find the maximum element of an array of positive integers:
HardVery Likely
dynamic-programmingprefix-sum
Arithmetic Slices II - Subsequence
SolveGiven an integer array nums, return the number of all the arithmetic subsequences of nums.
HardLikely
arraydynamic-programming
Count Complete Tree Nodes
SolveGiven the root of a complete binary tree, return the number of the nodes in the tree.
EasyLikely
binary-searchbit-manipulationtree
Preparing for your Dunzo coding interview
Dunzo interviews focus heavily on dynamic-programming, array, string 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. Dunzo 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.
Frequently Asked Questions
What coding problems does Dunzo ask in interviews?add
Dunzo has been reported to ask 7 distinct coding problems. The most common topics are dynamic-programming, array, string. 1 are Easy difficulty, 2 are Medium, and 4 are Hard. Problems are sorted by frequency - the ones at the top are asked most often.
How hard are Dunzo coding interviews?add
Based on 7 reported problems, Dunzo interviews are significantly harder than average - 57% Hard vs 18% across all companies. 29% of questions are Medium difficulty. Focus on the high-frequency Medium problems first, then work through the Hard ones.
How should I prepare for a Dunzo coding interview?add
Start with the highest-frequency problems listed on this page. Focus on the core topics: dynamic-programming, array, string. Practice solving them under time pressure and explaining your approach out loud. Mock interviews with AI can simulate the real experience.
Other companies to explore
Ready to ace your Dunzo interview?
Simulate a real Dunzo coding interview with an AI interviewer. Get a scorecard with specific feedback on your problem-solving, code quality, and communication.
Simulate a Dunzo interview with AIarrow_forward