DSA Doctor
Verified Company Vault
Dream11 DSA Interview Questions
13 curated coding interview questions directly asked in Dream11 technical rounds, sorted by frequency with recency and difficulty diagnostics.
13
Total Questions
1 (8%)
Easy Problems
11 (85%)
Medium Problems
1 (8%)
Hard Problems
🔥 Most Tested Topics:
Core DSA (6)Arrays (5)Trees (2)Greedy (1)Dynamic Programming (1)
📂 Sourced Datasets:
All questionsOlder than 6 months
| ID | Problem | Difficulty | Topic | Pattern | Acceptance | Frequency | Recency |
|---|---|---|---|---|---|---|---|
| 1475 | Final Prices With a Special Discount in a Shop | Easy | Core DSA | Implementation / Reasoning | 84.1% | 100.0% | all |
| 735 | Asteroid Collision | Medium | Core DSA | Implementation / Reasoning | 47.9% | 87.5% | all |
| 1642 | Furthest Building You Can Reach | Medium | Core DSA | Implementation / Reasoning | 50.9% | 75.0% | all |
| 1526 | Minimum Number of Increments on Subarrays to Form a Target Array | Hard | Arrays | Sorting / Prefix / Scan | 78.2% | 75.0% | all |
| 931 | Minimum Falling Path Sum | Medium | Arrays; Trees | Sorting / Prefix / Scan; DFS / BFS | 60.8% | 62.5% | all |
| 134 | Gas Station | Medium | Greedy | Greedy | 48.0% | 62.5% | all |
| 15 | 3Sum | Medium | Arrays | Sorting / Prefix / Scan | 39.1% | 62.5% | all |
| 2222 | Number of Ways to Select Buildings | Medium | Core DSA | Implementation / Reasoning | 50.9% | 62.5% | all |
| 416 | Partition Equal Subset Sum | Medium | Arrays; Dynamic Programming | Sorting / Prefix / Scan; State Transition | 49.5% | 62.5% | all |
| 3 | Longest Substring Without Repeating Characters | Medium | Strings; Trees | Hashing / Sliding Window; DFS / BFS; Sliding Window | 39.1% | 62.5% | all |
| 994 | Rotting Oranges | Medium | Core DSA | Implementation / Reasoning | 58.7% | 62.5% | all |
| 16 | 3Sum Closest | Medium | Arrays | Sorting / Prefix / Scan | 48.6% | 62.5% | all |
| 11 | Container With Most Water | Medium | Core DSA | Two Pointers | 60.0% | 62.5% | all |