Dream11 Interview Questions — 11 DSA Problems

11 problems with full solutions in Python, Java, C++, JavaScript, Go, Rust.

Most frequently asked Dream11 LeetCode questions for software engineering interviews.

• Final Prices With a Special Discount in a Shop (EASY) — Array, Stack, Monotonic Stack
• Asteroid Collision (MEDIUM) — Array, Stack, Simulation
• Furthest Building You Can Reach (MEDIUM) — Array, Greedy, Heap (Priority Queue)
• Gas Station (MEDIUM) — Array, Greedy
• 3Sum (MEDIUM) — Array, Two Pointers, Sorting
• Minimum Number of Increments on Subarrays to Form a Target Array (HARD) — Array, Dynamic Programming, Stack, Greedy, Monotonic Stack
• Minimum Falling Path Sum (MEDIUM) — Array, Dynamic Programming, Matrix
• Shortest Common Supersequence (HARD) — String, Dynamic Programming
• Number of Ways to Select Buildings (MEDIUM) — String, Dynamic Programming, Prefix Sum
• Partition Equal Subset Sum (MEDIUM) — Array, Dynamic Programming
• Minimum Path Sum (MEDIUM) — Array, Dynamic Programming, Matrix