Merge IntervalsMedium

Merge Intervals

Medium 21.3k47% acceptance

ArrayIntervalsSorting

Given an array of intervals where intervals[i] = [startᵢ, endᵢ], merge all overlapping intervals and return the non-overlapping intervals that cover all the input, sorted by start.

Example 1

Input: intervals = [[1,3],[2,6],[8,10],[15,18]]

Output: [[1,6],[8,10],[15,18]]

[1,3] and [2,6] overlap → [1,6].

Example 2

Input: intervals = [[1,4],[4,5]]

Output: [[1,5]]

Touching intervals merge.

Constraints

1 ≤ intervals.length ≤ 10⁴
intervals[i].length == 2
0 ≤ startᵢ ≤ endᵢ ≤ 10⁴

Asked atGoogleMetaAmazonMicrosoft

JavaScript

⌘↵ to run

Loading editor…

Case 1

[[1,3],[2,6],[8,10],[15,18]]

expected: [[1,6],[8,10],[15,18]]

Case 2

[[1,4],[4,5]]

expected: [[1,5]]

Case 3

[[1,4],[0,4]]

expected: [[0,4]]