LeetCode 252 Meeting Rooms - Implementation

Sort by start time. Check adjacent pairs for overlap.

def canAttendMeetings(intervals): intervals.sort(key=lambda x: x[0])

for i in range(1, len(intervals)):
    if intervals[i][0] < intervals[i - 1][1]:
        return False

return True

$O(n \log n)$ time, $O(1)$ extra space.