6 curated coding interview questions directly asked in Dunzo technical rounds, sorted by frequency with recency and difficulty diagnostics.
| ID | Problem | Difficulty | Topic | Pattern | Acceptance | Frequency | Recency |
|---|---|---|---|---|---|---|---|
| 1690 | Stone Game VII | Medium | Core DSA | Implementation / Reasoning | 58.7% | 100.0% | all |
| 1420 | Build Array Where You Can Find The Maximum Exactly K Comparisons | Hard | Arrays | Sorting / Prefix / Scan | 65.7% | 100.0% | all |
| 1698 | Number of Distinct Substrings in a String | Medium | Strings; Trees | Hashing / Sliding Window; DFS / BFS | 64.8% | 100.0% | all |
| 1639 | Number of Ways to Form a Target String Given a Dictionary | Hard | Strings | Hashing / Sliding Window | 56.5% | 100.0% | all |
| 1397 | Find All Good Strings | Hard | Strings | Hashing / Sliding Window | 45.4% | 100.0% | all |
| 1664 | Ways to Make a Fair Array | Medium | Arrays | Sorting / Prefix / Scan | 66.9% | 100.0% | all |