Easy Greedy

Amazon

Amazon

Apple

Bloomberg

Facebook

Google

Microsoft

Oracle

Roblox

Snapchat

Yandex

eBay

2020-10-31

252. Meeting Rooms

Similar Question: LeetCode Question 253

Question:

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.length == 2
• 0 <= starti < endi <= 106

Solution:

Sort the interval based on the start time and them check if there’s any conflict.

class Solution {
    public boolean canAttendMeetings(int[][] intervals) {
        Arrays.sort(intervals, (a, b) -> (a[0] - b[0]));
        for (int i = 1; i < intervals.length; i++) {
            if (intervals[i][0] < intervals[i - 1][1]) {
                return false;
            }
        }
        return true;
    }
}