Greedy
Make locally optimal choices for global solutions.
Scheduling
Pick a maximal non-conflicting set.
Checkpoint
A graded check on local choices, counterexamples, and exchange proofs.
Pattern Quest
Practice recognizing greedy problem shapes.
Greedy
Practice committing to the locally best safe choice and justifying it with an exchange or stays-ahead argument instead of revisiting earlier decisions.
- Jump Game (Medium)
- Longest Happy String (Medium)
- Minimum Time to Make Rope Colorful (Medium)
- Equal Sum Arrays With Minimum Number of Operations (Medium)