Loading problem…
Given an array of meeting time intervals where intervals[i] = [start_i, end_i], determine if a person could attend all meetings. Return true if a person can attend all meetings without any overlap, and false otherwise.
Example 1
Input: intervals = [[0,30],[5,10],[15,20]]
Output: false
Explanation: The meeting [0,30] runs the whole time that [5,10] and [15,20] take place, so the person cannot attend all of them.
Example 2
Input: intervals = [[7,10],[2,4]]
Output: true
Explanation: [2,4] ends well before [7,10] starts, so the two meetings never overlap.
Example 3
Input: intervals = [[1,2],[2,3]]
Output: true
Explanation: The first meeting ends at 2, exactly when the second starts. Touching end points do not count as an overlap.
After sorting meetings by start time, the only possible conflicts are between consecutive meetings. If any meeting starts before the previous one ends, they overlap.
Run checks all cases above. Submit evaluates all test cases.