Problem database last updated: June 20, 2025
11 problems · 1 Easy, 8 Medium, 2 Hard · Ranked #137 of 458
1 Easy
9% · avg 23%
8 Medium
73% · avg 59%
2 Hard
18% · avg 18%
Based on 11 reported problems, Dream11 interviews are in line with industry averages - 18% Hard vs 18% overall. The majority (73%) of questions are Medium difficulty, which is typical for companies that want to see solid fundamentals without excessive trick questions.
Compared to the industry average, Dream11 puts unusual emphasis on monotonic-stack (18.2% of problems, 6.3x the industry average), stack (27.3% of problems, 3.2x the industry average), greedy (27.3% of problems, 3.2x the industry average). If you're short on time, these are the categories to double down on.
The most common topics are array (81.8%), dynamic-programming (54.5%), stack (27.3%), greedy (27.3%). Problems below are sorted by frequency, the ones at the top are asked most often.
| Problem | Difficulty | Frequency | Topics | |
|---|---|---|---|---|
Final Prices With a Special Discount in a Shop You are given an integer array prices where prices[i] is the price of the ith item in a shop. | Easy | Very Likely | arraystackmonotonic-stack | Solve |
Asteroid Collision We are given an array asteroids of integers representing asteroids in a row. The indices of the asteroid in the array represent their relative position in space... | Medium | Very Likely | arraystacksimulation | Solve |
Furthest Building You Can Reach You are given an integer array heights representing the heights of buildings, some bricks, and some ladders. | Medium | Likely | arraygreedyheap-priority-queue | Solve |
3Sum Given an integer array nums, return all the triplets [nums[i], nums[j], nums[k]] such that i != j, i != k, and j != k, and nums[i] + nums[j] + nums[k] == 0. | Medium | Likely | arraytwo-pointerssorting | Solve |
Gas Station There are n gas stations along a circular route, where the amount of gas at the ith station is gas[i]. | Medium | Likely | arraygreedy | Solve |
Minimum Number of Increments on Subarrays to Form a Target Array You are given an integer array target. You have an integer array initial of the same size as target with all elements initially zeros. | Hard | Likely | arraydynamic-programmingstack | Solve |
Partition Equal Subset Sum Given an integer array nums, return true if you can partition the array into two subsets such that the sum of the elements in both subsets is equal or false oth... | Medium | Likely | arraydynamic-programming | Solve |
Minimum Falling Path Sum Given an n x n array of integers matrix, return the minimum sum of any falling path through matrix. | Medium | Likely | arraydynamic-programmingmatrix | Solve |
Shortest Common Supersequence Given two strings str1 and str2, return the shortest string that has both str1 and str2 as subsequences. If there are multiple valid strings, return any of them... | Hard | Likely | stringdynamic-programming | Solve |
Number of Ways to Select Buildings You are given a 0-indexed binary string s which represents the types of buildings along a street where: | Medium | Likely | stringdynamic-programmingprefix-sum | Solve |
Minimum Path Sum Given a m x n grid filled with non-negative numbers, find a path from top left to bottom right, which minimizes the sum of all numbers along its path. | Medium | Likely | arraydynamic-programmingmatrix | Solve |
Final Prices With a Special Discount in a Shop
SolveYou are given an integer array prices where prices[i] is the price of the ith item in a shop.
Asteroid Collision
SolveWe are given an array asteroids of integers representing asteroids in a row. The indices of the asteroid in the array represent their relative position in space...
Furthest Building You Can Reach
SolveYou are given an integer array heights representing the heights of buildings, some bricks, and some ladders.
3Sum
SolveGiven an integer array nums, return all the triplets [nums[i], nums[j], nums[k]] such that i != j, i != k, and j != k, and nums[i] + nums[j] + nums[k] == 0.
Gas Station
SolveThere are n gas stations along a circular route, where the amount of gas at the ith station is gas[i].
Minimum Number of Increments on Subarrays to Form a Target Array
SolveYou are given an integer array target. You have an integer array initial of the same size as target with all elements initially zeros.
Partition Equal Subset Sum
SolveGiven an integer array nums, return true if you can partition the array into two subsets such that the sum of the elements in both subsets is equal or false oth...
Minimum Falling Path Sum
SolveGiven an n x n array of integers matrix, return the minimum sum of any falling path through matrix.
Shortest Common Supersequence
SolveGiven two strings str1 and str2, return the shortest string that has both str1 and str2 as subsequences. If there are multiple valid strings, return any of them...
Number of Ways to Select Buildings
SolveYou are given a 0-indexed binary string s which represents the types of buildings along a street where:
Minimum Path Sum
SolveGiven a m x n grid filled with non-negative numbers, find a path from top left to bottom right, which minimizes the sum of all numbers along its path.
Frequency scores are based on crowdsourced interview reports. A higher score means the problem has been reported more often in recent Dream11 interviews.
Very Likely
75-100%
Likely
50-74%
Sometimes
25-49%
Rare
0-24%
Dream11 interviews focus heavily on array, dynamic-programming, stack problems. If you're short on time, these are the categories to prioritize. The problems on this page are sorted by frequency, so start from the top and work your way down.
Beyond solving problems, practice explaining your approach. Dream11 interviewers care about your thought process - how you break down a problem, consider edge cases, and evaluate tradeoffs between solutions. A clean O(n) solution you can explain clearly beats an O(log n) solution you can't articulate.
Looking for more companies? Browse all 458 companies in our directory, or sharpen your fundamentals with our free data structure visualizers and AI-powered DSA tutor.
Dream11 has been reported to ask 11 distinct coding problems. The most common topics are array, dynamic-programming, stack. 1 are Easy difficulty, 8 are Medium, and 2 are Hard. Problems are sorted by frequency - the ones at the top are asked most often.
Based on 11 reported problems, Dream11 interviews are in line with industry averages - 18% Hard vs 18% overall. 73% of questions are Medium difficulty. Focus on the high-frequency Medium problems first, then work through the Hard ones.
Start with the highest-frequency problems listed on this page. Focus on the core topics: array, dynamic-programming, stack. Practice solving them under time pressure and explaining your approach out loud. Mock interviews with AI can simulate the real experience.
Simulate a real Dream11 coding interview with an AI interviewer. Get a scorecard with specific feedback on your problem-solving, code quality, and communication.
Simulate a Dream11 interview with AIarrow_forward
