Step 1 — Greedy Algorithms
💰
Greedy: Make the Best Local Choice
Activity selection: sort by finish time → always pick earliest-finishing compatible activity
Goal: Apply and prove greedy algorithms for activity selection, interval problems, and fractional knapsack.