LeetCode 252 Meeting Rooms - Solution

The core idea

Sort intervals by start time. Then check if any meeting starts before the previous one ends.

If sorted intervals have intervals[i].start < intervals[i-1].end, there's an overlap.

One pass through sorted intervals suffices. If no overlaps found, return true.