We’re preparing your current view and syncing the latest data.
Given an array of intervals where intervals[i] = [start_i, end_i], merge all overlapping intervals, and return an array of the non-overlapping intervals that cover all the intervals in the input.
An array of intervals, where each interval is represented as a two-element array [start, end].
An array of merged non-overlapping intervals sorted by their start times.
1 <= intervals.length <= 10^4; intervals[i].length == 2; 0 <= start_i <= end_i <= 10^4
Example 1
Input
[[1,3],[2,6],[8,10],[15,18]]
Output
[[1,6],[8,10],[15,18]]
Explanation
Intervals [1,3] and [2,6] overlap, so they are merged into [1,6]. The other intervals do not overlap.
Example 2
Input
[[1,4],[4,5]]
Output
[[1,5]]
Explanation
Intervals [1,4] and [4,5] are considered overlapping, so they are merged into [1,5].