Greedy algorithms make locally optimal decisions at each step with the goal of finding a global optimum. Master interval scheduling, jump game reachability, coin change bounds, and gas station loops in C++.
Greedy Choice Property: A locally optimal choice can lead to a globally optimal solution.
Interval End Sorting: Sorting intervals by finish time maximizes non-overlapping selections.
Exchange Argument Proof: Proving that replacing optimal choices with greedy choices preserves feasibility.
Reachability Bounds: Tracking maximum reachable index in single linear passes.