Maximum Compatible Meetings — Solution & Editorial

Back to the Problem

The classic exchange-argument greedy: sort by right endpoint and take every interval that starts after the last chosen one ends.

Complexity: O(N log N)