PATTERN 13 · 3 PROBLEMS
Greedy scans
Commit to the locally best safe choice while preserving a proof that no discarded choice can win.
Start the first lesson ↗MASTER KEYA greedy move needs an exchange argument, not a hunch.
0OF 3
RECALLED
RECALLED
The best sale today depends only on the cheapest earlier price.
Not started
↗02Best Time to Buy and Sell Stock
The best sale today depends only on the cheapest earlier price.
Not started
↗03Maximum Subarray
A negative running prefix can only hurt any future subarray.
Not started
↗Jump Game
Every reachable index can extend the farthest reachable frontier.