> For the complete documentation index, see [llms.txt](https://jaywin.gitbook.io/leetcode/llms.txt). Markdown versions of documentation pages are available by appending `.md` to page URLs; this page is available as [Markdown](https://jaywin.gitbook.io/leetcode/solutions/0252-meeting-rooms.md).

# 0252. Meeting Rooms

<https://leetcode.com/problems/meeting-rooms>

## Description

Given an array of meeting time `intervals` where `intervals[i] = [starti, endi]`, determine if a person could attend all meetings.

**Example 1:**

```
**Input:** intervals = [[0,30],[5,10],[15,20]]
**Output:** false
```

**Example 2:**

```
**Input:** intervals = [[7,10],[2,4]]
**Output:** true
```

**Constraints:**

* `0 <= intervals.length <= 104`
* `intervals[i].length == 2`
* `0 <= starti < endi <= 106`

## ac

```java
/**
 * Definition for an interval.
 * public class Interval {
 *     int start;
 *     int end;
 *     Interval() { start = 0; end = 0; }
 *     Interval(int s, int e) { start = s; end = e; }
 * }
 */
class Solution {
    public boolean canAttendMeetings(Interval[] intervals) {
        // edge cases
        if (intervals == null || intervals.length <= 1) return true;

        Arrays.sort(intervals, (a, b) -> {return a.start - b.start;});

        Interval prev = intervals[0];
        for (int i = 1; i < intervals.length; i++) {
            Interval curr = intervals[i];
            if (curr.start < prev.end) {
                return false;
            } else {
                prev = curr;
            }
        }

        return true;
    }
}
```