Dream11 coding interview questions
Ranked by how often candidates report them. Each opens in the editor with hidden tests, an animated walkthrough and solutions in four languages; a question you solve once counts for every company that asks it.
| Progress | Title | Difficulty | Next step |
|---|---|---|---|
| Final Prices With a Special Discount in a ShopMonotonic Stack | Easy | Solve | |
| Asteroid CollisionStack Basics | Medium | Solve | |
| Furthest Building You Can ReachTop K / Kth Largest / Smallest | Medium | Solve | |
| Gas StationKadane's Algorithm | Medium | Solve | |
| Minimum Falling Path Sum2D DP - max/min of last row | Medium | Solve | |
| 3SumTwo Sum | Medium | Solve | |
| Partition Equal Subset SumKnapsack | Medium | Solve | |
| Longest Substring Without Repeating CharactersSliding Window · Variable | Medium | Solve | |
| Rotting OrangesMulti source BFS | Medium | Solve | |
| Container With Most WaterTwo Pointer | Medium | Solve | |
| Minimum Number of Days to Make m BouquetsBinary Search on Answer Space | Medium | Solve | |
| Remove K DigitsMonotonic Stack | Medium | Solve | |
| Minimum Path Sum2D DP | Medium | Solve | |
| First Missing PositiveIn-place Transformations | Hard | Solve | |
| Split Array Largest SumBinary Search on Answer Space | Hard | Solve | |
| Course Schedule IITopological Sort | Medium | Solve | |
| Kth Largest Element in an ArrayTop K / Kth Largest / Smallest | Medium | Solve | |
| HeatersBisect | Medium | Solve | |
| Search a 2D Matrix2D Binary Search + Step Search | Medium | Solve | |
| 4SumTwo Pointer | Medium | Solve | |
| Contiguous ArrayPrefix Sum Strategy | Medium | Solve | |
| Lowest Common Ancestor of a Binary TreeLCA | Medium | Solve | |
| Best Time to Buy and Sell StockState Machine DP - Stock Problems | Easy | Solve | |
| Next Greater Element IMonotonic Stack | Easy | Solve | |
| Spiral MatrixMatrix Traversal | Medium | Solve | |
| Edit DistanceStrings | Medium | Solve |
No questions match these filters.
Also reported, being added to AlgoRung (3)
3Sum Closest · Number of Ways to Select Buildings · Minimum Number of Increments on Subarrays to Form a Target Array
Questions people ask
What coding questions does Dream11 ask most?
Final Prices With a Special Discount in a Shop, Asteroid Collision, Furthest Building You Can Reach, Gas Station, Minimum Falling Path Sum, 3Sum, Partition Equal Subset Sum, Longest Substring Without Repeating Characters.
Which topics come up in Dream11 coding rounds?
stack, dynamic programming, binary search, heaps, graphs, two pointers.
How hard are Dream11 coding questions?
Of the reported questions, 3 are easy, 21 medium and 2 hard. A 45 to 60 minute live interview where you solve one or two data-structures-and-algorithms problems while explaining your thinking. Interviewers score problem solving, code quality, testing and communication.