26. Greedy algorithms and optimization
Use greedy choice, local improvement, approximation, and constraint thinking for problems where perfect exhaustive search is too expensive. You will practice recognizing when a greedy strategy is valid and when it quietly fails.