Phase 14Days 72-75

Greedy Algorithms

Recognize when local choices are globally optimal, and prove it

Phase Goal

Build the instinct to spot a greedy structure and back it with an exchange argument.

Progress

Day 72: Greedy foundations

Day 73: Interval scheduling

Day 74: Scheduling & sequencing

Day 75: Greedy problem set & recap

Phase Complete!

After this phase, you'll be able to:

  • Greedy foundations
  • Interval scheduling
  • Scheduling & sequencing
  • Greedy problem set & recap

After Phase 14, explain a core invariant, reconstruct a solution after a delay, diagnose a bug, and solve one unlabelled variation. Repair a failed prerequisite before advancing; record help separately from independent work.