BackmediumArrays arrays sorting

Merge Intervals Solution

Problem Statement

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.

Example 1

Input

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

Output

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

Explanation: Intervals [1,3] and [2,6] overlap since 2 <= 3, so they merge into [1,6]. The remaining intervals [8,10] and [15,18] do not overlap.

Constraints

1 <= intervals.length <= 10^4
intervals[i].length == 2
0 <= start_i <= end_i <= 10^4

Merge Intervals Solution

Problem Statement

Input

Output

Constraints

More Arrays Problems

Optimized Approach

Step-by-Step Dry Run

Tested Solutions