You have learned the activity selection pattern:
Sort by end time to maximize non-overlapping selections.
Greedy works because earliest-ending never blocks better solutions.
Exchange argument proves optimality.
Same pattern applies to non-overlapping intervals and minimum arrows.
Meeting rooms is different: count simultaneous meetings. Good job on finishing this section. You now have a powerful tool for interval problems.