Problem Brief

Merge Intervals 🍋

INTERNNEW GRADOA

See Amazon online assessment and hiring insights

AMZ Interval Collection (A group of problems focused on operations involving intervals :) -

1. Merge Intervals (Intern, NG)

2. Find Overlapping Times (Intern)

3. Get Maximum Sum Find Overlapping Times (Full-Time)

4. Task Scheduler (Full-Time)

5. Optimal Interval Difference

Given an array of intervals where intervals[i] = [starti, endi], merge all overlapping intervals, and return an array of the non-overlapping intervals that cover all the intervals in the input.

♫⋆｡♪˚♬ ﾟ., Credit to whale 🐳 ✶࿐

1Example 1

Input

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

Output

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

Explanation

Since intervals [1,3] and [2,6] overlap, merge them into [1,6].

2Example 2

Input

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

Output

[[1,5]]

Explanation

Intervals [1,4] and [4,5] are considered overlapping.

Constraints

Limits and guarantees your solution can rely on.

1 <= intervals.length <= 10⁴
intervals[i].length == 2
0 <= starti <= endi <= 10⁴