Dunzo LeetCode Questions
7 questions all-time · 1 easy · 3 medium · 3 hard
| # | Problem | Difficulty | Frequency | Acceptance |
|---|---|---|---|---|
| 1 | Stone Game VII Array, Math, Dynamic Programming, Game Theory | Medium | 100 | 0.6% |
| 2 | Build Array Where You Can Find The Maximum Exactly K Comparisons Dynamic Programming, Prefix Sum | Hard | 100 | 0.7% |
| 3 | Number of Distinct Substrings in a String String, Trie, Rolling Hash, Suffix Array, Hash Function | Medium | 100 | 0.6% |
| 4 | Number of Ways to Form a Target String Given a Dictionary Array, String, Dynamic Programming | Hard | 100 | 0.6% |
| 5 | Find All Good Strings String, Dynamic Programming, String Matching | Hard | 100 | 0.5% |
| 6 | Ways to Make a Fair Array Array, Prefix Sum | Medium | 100 | 0.7% |
| 7 | Count Complete Tree Nodes Binary Search, Bit Manipulation, Tree, Binary Tree | Easy | 64 | 0.7% |
How to read this list
The tabs at the top split the questions by how recently people said they were asked in interviews. "Last 30 Days" is the past month, "Last 3 Months" is the past quarter, and so on. "All Time" is every question on record for this company.
Frequency is a score from 0 to 100 for how often a question showed up in that time window. A higher number means it came up more often, so the list starts with the most common questions first. Acceptance is the share of submissions that pass on LeetCode. Click any question to open it on LeetCode.