Problem
You get a list intervals of meetings. Each item [start, end] is one meeting that starts at time start and ends at time end.
Return true if one person can attend all the meetings. Return false otherwise.
A person can attend a meeting that starts at the same time as another meeting ends. For example, a person can attend [1, 3] and then [3, 5].
Example 1
- Input:
- intervals = [[9,10],[13,15],[10,12]]
- Output:
- true
- Explanation:
- In order of start time, each meeting ends before or when the next meeting starts.
Example 2
- Input:
- intervals = [[2,8],[7,9]]
- Output:
- false
- Explanation:
- The second meeting starts at 7, but the first meeting ends at 8.
Constraints
- 0 <= intervals.length <= 10^4
- intervals[i].length == 2
- 0 <= start < end <= 10^6
SysRound wrote this statement. A reference solution checks every example.
Related questions
Continue with questions that share topics or the same question type.
- Meeting Room Scheduling - Minimum Rooms Required
Coding
- Meeting Rooms II
Coding · Array · Greedy · Heap (Priority Queue)
- Meeting Rooms III
Coding · Array · Hash Table · Heap (Priority Queue)
- Schedule meeting rooms to reduce fragmentation
Coding
Sources · 1 reference
These records explain where the question appears. A company tag or candidate report does not guarantee a future interview question.
Hello Interview · 5 records
Amazon
Leetcode 252. Meeting Rooms
Reported Jul 6, 2026 · 1 source report
SENIOR
Source snapshot: Nov 12, 2026
View sourceGoogle
Leetcode 252. Meeting Rooms
Reported Oct 21, 2024 · 1 source report
INTERN
Source snapshot: Nov 12, 2026
View sourceMeta
Leetcode 252. Meeting Rooms
Reported Jan 10, 2025 · 1 source report
MID_LEVEL
Source snapshot: Nov 12, 2026
View sourceProcore
Leetcode 252. Meeting Rooms
Reported Jan 20, 2026 · 1 source report
SENIOR
Source snapshot: Nov 12, 2026
View source