Blind 75 Greedy Questions

2 problems · Free practice

A greedy solution keeps only the information needed to make the next safe decision. For Maximum Subarray, decide whether the current sum helps the next position. For Jump Game, track the furthest reachable position. These compact solutions still need a proof of why discarded history cannot improve a future answer.

Practice greedy

Maximum Subarray
Medium
Find the greatest sum of a nonempty contiguous subarray within a nonempty integer array.
Jump Game
Medium
Each nonnegative array value is the maximum jump length allowed from that index. Starting at index 0, determine whether you can reach the final index of a nonempty array.

What to focus on

Write what the running value means after processing each position.
Explain why keeping more history would not change the next decision.
Test all-negative arrays for Maximum Subarray and unreachable gaps for Jump Game.

All 75 questions and your progress checklist