💡 Select activities with earliest finish times that don't overlap!
📚 Activity Selection Problem
Select maximum number of non-overlapping activities:
- Sort activities by finish time
- Always pick activity with earliest finish time
- Skip activities that overlap with already selected
- Greedy choice: earliest finish leaves most room for others
- Time: O(n log n) for sorting