Meeting Rooms
- 1 min read
- LC-Easy
- Interval
Solution
- Just sort intervals, and if there's an overlap, return False.
- If end of code if reached, there was no overlap, return True
| Time | Space | Explanation |
|---|
O() | O() | |
def canAttendMeetings(self, intervals: List[List[int]]) -> bool:
intervals.sort()
for i in range(1, len(intervals)):
prev, curr = intervals[i - 1], intervals[i]
if curr[0] < prev[1]:
return False
return True