Implement Greedy Interval Scheduling

sort-then-sweep over intervals

Challenge 3 of Recursion, Greedy & DPIntermediate~55 minFree

Solve classic calendar and scheduling problems with greedy interval algorithms: merge and insert intervals, detect conflicts, count meeting rooms, and select the most non-overlapping activities.

5 steps

1. 1Merge Intervals
2. 2Insert Interval
3. 3Can Attend All Meetings
4. 4Minimum Meeting Rooms
5. 5Maximum Non-Overlapping Intervals