Dunzo Interview Questions — 8 DSA Problems
7 problems with full solutions in Python, Java, C++, JavaScript, Go, Rust.
Most frequently asked Dunzo LeetCode questions for software engineering interviews.
- Stone Game VII (MEDIUM) — Array, Math, Dynamic Programming, Game Theory
- Build Array Where You Can Find The Maximum Exactly K Comparisons (HARD) — Dynamic Programming, Prefix Sum
- Number of Distinct Substrings in a String (MEDIUM) — String, Trie, Rolling Hash, Suffix Array, Hash Function
- Number of Ways to Form a Target String Given a Dictionary (HARD) — Array, String, Dynamic Programming
- Find All Good Strings (HARD) — String, Dynamic Programming, String Matching
- Ways to Make a Fair Array (MEDIUM) — Array, Prefix Sum
- Arithmetic Slices II - Subsequence (HARD) — Array, Dynamic Programming
- Count Complete Tree Nodes (EASY) — Binary Search, Bit Manipulation, Tree, Binary Tree
D
Dunzo
8 questions tracked7 with solutions
Frequency scoreSorted highest → lowest frequency✓ Our Solution = we have a detailed walkthrough
Showing 8 of 8 questions
1ArrayMathDynamic ProgrammingGame Theory
2HardBuild Array Where You Can Find The Maximum Exactly K Comparisons✓ Our Solution Dynamic ProgrammingPrefix Sum
3MediumNumber of Distinct Substrings in a String
StringTrieRolling HashSuffix Array+1
4HardNumber of Ways to Form a Target String Given a Dictionary✓ Our Solution ArrayStringDynamic Programming
5StringDynamic ProgrammingString Matching
8Binary SearchBit ManipulationTreeBinary Tree
