Dream11 Coding Interview Questions: 14 Tagged Problems
14 coding problems tagged Dream11 — 1 easy · 13 medium — with solutions in 13 languages. Plus a 2-week study plan by topic.
- Problems: 14
- By difficulty: 1 easy · 13 medium
- Languages: JavaScript, TypeScript, Python, Java, C++, C, C#, Go, Kotlin, Swift, Rust, PHP and Ruby
- Cost: Free on every plan; sign in to run and submit
14 problems the CodeKairo catalogue tags as commonly asked in Dream11's coding rounds — 1 easy and 13 medium, no hard ones — each judged by hidden tests in 13 languages. The most common topics among them are Arrays (12), Greedy (4) and Dynamic Programming (4). Tagged for Dream11 and no other company: 3Sum Closest, Furthest Building You Can Reach and Partition Equal Subset Sum. The tag is the catalogue's own annotation of where a problem tends to come up — not a list published by Dream11, which CodeKairo is not affiliated with.
Dream11 study plan by topic
All 14 problems tagged Dream11 over 2 weeks, about 7 h 55 min of solving, grouped by technique in the order they build on each other — Counting, Two Pointers, Sliding Window and Prefix Sum and 7 more.
Week 1: Counting, Two Pointers, Sliding Window +6
12 problems on Counting, Two Pointers, Sliding Window, Prefix Sum, Stack, Monotonic Stack, Matrix, Greedy and Heap, easiest first within each topic.
- Destroy Sequential Targets Medium
- 3Sum Medium
- Container With Most Water Medium
- 3Sum Closest Medium
- Longest Substring Without Repeating Characters Medium
- Number of Ways to Select Buildings Medium
- Asteroid Collision Medium
- Final Prices With a Special Discount in a Shop Easy
- Minimum Number of Increments on Subarrays to Form a Target Array Medium
- Minimum Falling Path Sum Medium
- Gas Station Medium
- Furthest Building You Can Reach Medium
Week 2: Breadth-First Search, Dynamic Programming
2 problems on Breadth-First Search and Dynamic Programming, easiest first within each topic.
- Rotting Oranges Medium
- Partition Equal Subset Sum Medium
All problems tagged Dream11
Easy (1)
- Final Prices With a Special Discount in a Shop Array, Stack, Monotonic Stack
Medium (13)
- Minimum Number of Increments on Subarrays to Form a Target Array Array, Greedy, Dynamic Programming
- Number of Ways to Select Buildings String, Dynamic Programming, Prefix Sum
- Destroy Sequential Targets Array, Hash Table, Counting
- Minimum Falling Path Sum Array, Dynamic Programming, Matrix
- 3Sum Closest Array, Two Pointers, Sorting
- 3Sum Array, Two Pointers, Sorting
- Rotting Oranges Array, Matrix, Breadth-First Search
- Furthest Building You Can Reach Array, Heap, Greedy
- Partition Equal Subset Sum Array, Dynamic Programming
- Gas Station Array, Greedy
- Asteroid Collision Array, Stack, Simulation
- Container With Most Water Array, Two Pointers, Greedy
- Longest Substring Without Repeating Characters String, Sliding Window, Hash Table
Topics Dream11 asks most
- Arrays 12 problems
- Greedy 4 problems
- Dynamic Programming 4 problems
- Two Pointers 3 problems
- Stack 3 problems
- Strings 2 problems
- Hash Table 2 problems
- Sorting 2 problems
- Monotonic Stack 2 problems
- Matrix 2 problems
- Counting 1 problem
- Sliding Window 1 problem