Documentation Index
Fetch the complete documentation index at: /llms.txt
Use this file to discover all available pages before exploring further.
Tested Python solution for LeetCode 252 with 18 pytest cases. Generate a practice environment with lcpy.
lcpy gen -n 252 # by problem number
lcpy gen -s meeting_rooms # by problem name
[[s1,e1],[s2,e2],...] (si < ei), determine if a person could attend all meetings.
Input: [[0,30],[5,10],[15,20]]
Output: false
Input: [[7,10],[2,4]]
Output: true
class Solution:
# Time: O(n log n)
# Space: O(1)
def can_attend_meetings(self, intervals: list[list[int]]) -> bool:
if not intervals:
return True
# Sort intervals by start time
intervals.sort(key=lambda x: x[0])
# Check for overlaps
return all(intervals[i][0] >= intervals[i - 1][1] for i in range(1, len(intervals)))
| Time | Space |
|---|---|
| O(n log n) | O(1) |