Practice/Meta/Determine if All Intervals Have a Common Intersection

Determine if All Intervals Have a Common Intersection

CodingMust

Problem

You are given a collection of time intervals, where each interval is represented as a pair of integers [start, end] indicating a start time and end time (both inclusive). Your task is to determine whether there exists a time period that is covered by all intervals simultaneously.

Return true if all intervals share at least one common point or range, and false otherwise.

Requirements

1. Each interval is represented as [start, end] where start <= end
2. Both endpoints are inclusive (a time point at the boundary counts as being in the interval)
3. Return a boolean indicating whether all intervals have a common intersection
4. Handle edge cases including single intervals and identical intervals

Constraints

• 1 ≤= intervals.length ≤= 1000
• intervals[i].length == 2
• 0 ≤= start ≤= end ≤= 10^6
• All interval values are integers

Examples

Example 1:

Input: intervals = [[1, 5], [2, 6], [3, 4]] Output: true Explanation: All three intervals overlap in the range [3, 4]. Every point in this range is contained in all three intervals.

Example 2:

Input: intervals = [[1, 3], [4, 6], [2, 5]] Output: false Explanation: The first interval [1, 3] doesn't overlap with [4, 6] since 3 < 4. No single point exists in all three intervals.

Example 3:

Input: intervals = [[0, 10], [5, 8], [6, 7]] Output: true Explanation: The range [6, 7] is contained in all three intervals.

Example 4:

Input: intervals = [[1, 5], [5, 10]] Output: true Explanation: The point 5 is the boundary of both intervals and is included in both (endpoints are inclusive).