Greedy & Intervals

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.