Greedy Algorithms8 sections · 316 units
Open in Course

Meeting Rooms I - Algorithm

Simple overlap check

Algorithm: Sort by start time. Check if any meeting starts before the previous one ends.

function canAttendMeetings(intervals)
 sort intervals by start time ascending
 for i from 1 to length of intervals - 1
 if intervals[i].start < intervals[i-1].end then
 return false
 return true

Time: O(nlogn)O(n \log n). Space: O(1)O(1) extra.