Dream11 LeetCode interview questions

Explore Dream11 questions from the all problems list. Search by title or topic, filter by difficulty, and track solved problems on this device.

Time range

Problems in range

Solved

0 / 11

Range progress

Problem list

Select a problem to open it on LeetCode.

Problem	Difficulty	Frequency	Acceptance
Final Prices With a Special Discount in a Shop Array Stack Monotonic Stack EASY	Easy	100.0%	0.8%
Asteroid Collision Array Stack Simulation MEDIUM	Medium	89.0%	0.5%
Minimum Falling Path Sum Array Dynamic Programming Matrix MEDIUM	Medium	67.6%	0.6%
Gas Station Array Greedy MEDIUM	Medium	67.6%	0.5%
3Sum Array Two Pointers Sorting MEDIUM	Medium	67.6%	0.4%
Minimum Number of Increments on Subarrays to Form a Target Array Array Dynamic Programming Stack +2 HARD	Hard	67.6%	0.8%
Partition Equal Subset Sum Array Dynamic Programming Knapsack Problem +1 MEDIUM	Medium	67.6%	0.5%
Longest Substring Without Repeating Characters Hash Table String Sliding Window MEDIUM	Medium	67.6%	0.4%
Rotting Oranges Array Breadth-First Search Matrix MEDIUM	Medium	67.6%	0.6%
3Sum Closest Array Two Pointers Sorting MEDIUM	Medium	67.6%	0.5%
Container With Most Water Array Two Pointers Greedy MEDIUM	Medium	67.6%	0.6%

Showing 1–11 of 11 matching problems · All Problems

Dream11 LeetCode Interview Questions | Grind Practice