Meeting Rooms

Given an array of meeting time intervals intervals where intervals[i] = [starti, endi], determine if a person can attend all meetings.

Example 1:

• Input: [[0,30],[5,10],[15,20]]
• Output: false
• Why? Meeting [0,30] overlaps with both [5,10] and [15,20].

Example 2:

• Input: [[7,10],[2,4]]
• Output: true

Note: LeetCode 252, linked above, is a LeetCode Premium problem — opening it needs a Premium subscription. Everything needed to solve it is on this page.

We simply need to check if any two intervals overlap. If we sort them by start time, we only need to check adjacent meetings.

1. Sort: Sort intervals by start time.
2. Scan: Iterate through the sorted list.
3. Check: If current.start < previous.end, then there is an overlap. Return false immediately.
4. Result: If loop finishes without conflict, return true.

Visualize checking for conflicts one by one.