Dream11 coding interview
questions, leaked.
11 problems reported across recent Dream11 interviews. Top patterns: array, dynamic programming, stack. The list below is what most reported candidates actually saw, plus the honest play if you can't grind all of it.
Dream11 asks 11 problems on average, and the distribution is brutal: 73% medium, 18% hard, 9% easy. You won't find a warm-up. Arrays dominate every tier (9 of 11), and half the problems stack dynamic programming on top. Most candidates freeze on the DP+array hybrids like Minimum Number of Increments or Partition Equal Subset Sum. If you hit one cold during the live assessment, StealthCoder reads the prompt and serves a working solution invisible to the proctor in seconds. That's your insurance policy.
Top problems at Dream11
| # | Problem | Diff | Frequency | Pass % | Patterns |
|---|---|---|---|---|---|
| 01 | Final Prices With a Special Discount in a Shop | EASY | 100.0 | 83% | Array · Stack · Monotonic Stack |
| 02 | Asteroid Collision | MEDIUM | 78.8 | 46% | Array · Stack · Simulation |
| 03 | Furthest Building You Can Reach | MEDIUM | 72.2 | 50% | Array · Greedy · Heap (Priority Queue) |
| 04 | Gas Station | MEDIUM | 72.2 | 46% | Array · Greedy |
| 05 | 3Sum | MEDIUM | 72.2 | 37% | Array · Two Pointers · Sorting |
| 06 | Minimum Number of Increments on Subarrays to Form a Target Array | HARD | 72.2 | 72% | Array · Dynamic Programming · Stack |
| 07 | Partition Equal Subset Sum | MEDIUM | 62.8 | 48% | Array · Dynamic Programming |
| 08 | Shortest Common Supersequence | HARD | 62.8 | 61% | String · Dynamic Programming |
| 09 | Minimum Falling Path Sum | MEDIUM | 62.8 | 61% | Array · Dynamic Programming · Matrix |
| 10 | Number of Ways to Select Buildings | MEDIUM | 62.8 | 50% | String · Dynamic Programming · Prefix Sum |
| 11 | Minimum Path Sum | MEDIUM | 62.8 | 66% | Array · Dynamic Programming · Matrix |
Frequencies derived from public community-tagged interview reports. Click a row to view on LeetCode.
You have a week, maybe less. You can't out-grind the list above. StealthCoder runs invisibly during the actual Dream11 OA. The proctor cannot see it. Screen share cannot detect it. Built by an Amazon engineer who used it to pass JPMorgan's OA and system design loop.
Get StealthCoder- array9 · 82%
- dynamic programming6 · 55%
- stack3 · 27%
- greedy3 · 27%
- string2 · 18%
- matrix2 · 18%
- monotonic stack2 · 18%
- simulation1 · 9%
- heap priority queue1 · 9%
- two pointers1 · 9%
Array problems aren't just frequent, they're the backbone of every hard question Dream11 throws. Stack and monotonic-stack patterns appear in 5 problems total, but they're often the key to optimizing an array pass. Dynamic programming is the second pillar: 6 problems require it, and 4 of those are medium or hard. Greedy (3 problems) and two-pointers (1 problem) are lighter. Start with array fundamentals and monotonic-stack drills (Final Prices, Asteroid Collision), then move to DP+array hybrids (Minimum Falling Path Sum, Partition Equal Subset Sum). Gas Station and 3Sum are medium-tier traps that test greedy and sorting discipline. If you're uncertain on a DP recurrence during the actual assessment, StealthCoder bypasses the wall and unlocks the next problem.
Companies with similar patterns
If you prepped for Dream11, these companies recycle ~60% of the same topics.
You've seen the list.
Now make sure you pass Dream11.
Memorizing every problem above in a week is a fantasy. StealthCoder is the hedge: an AI overlay that's invisible during screen share. It reads the problem on screen and surfaces a working solution in under 2 seconds. Built by an Amazon engineer who used it to pass JPMorgan's OA and system design loop. Works on HackerRank, CodeSignal, CoderPad, and Karat.
Dream11 interview FAQ
How many array problems should I solve before the Dream11 assessment?+
At least 15 to 20. Arrays hit 9 of 11 problems here, so you need speed. Drill easy ones first (Final Prices), then move to medium array+stack (Asteroid Collision) and array+DP (Minimum Falling Path Sum). Depth matters more than volume.
Is dynamic programming really required for Dream11?+
Yes. 6 of 11 problems use it, including both hard questions. Half of those are array+DP, so you can't skip it. Partition Equal Subset Sum and Minimum Path Sum are mid-tier; master those before the assessment to avoid panicking on harder variants.
Should I learn monotonic stack before the assessment?+
Yes, but it's not your first priority. It appears in 2 problems and overlaps with array+stack themes. Final Prices With a Special Discount and Minimum Number of Increments both use it. Drill those two, then focus on DP if time is short.
What's the hardest problem type Dream11 asks?+
Both hards combine array, DP, and a third pattern. Minimum Number of Increments uses array, DP, stack, and greedy together. Shortest Common Supersequence is pure DP+string. You won't have time to invent these; drill the exact patterns from recent problems or go in with a backup.
How much time should I spend on greedy problems?+
Greedy hits 3 problems, all medium. Gas Station and Furthest Building are tricky because greedy logic is non-obvious. Allocate one to two hours total, but don't obsess. Arrays and DP are higher ROI for the assessment.