Classroom Block Merge (Hard)

Back

CodeDash

Classroom Block Merge

Hard

Arrays

In "Classroom Block Merge", each entry is a time interval [start, end].

Merge every overlapping interval and return the minimal list of non-overlapping intervals.

Example 1

Input:intervals = [[1,3],[2,6],[8,10],[9,12]]

Output:[[1,6],[8,12]]

For input intervals = [[1,3],[2,6],[8,10],[9,12]], overlapping ranges are combined, which produces the merged result [[1,6],[8,12]]. Therefore, return [[1,6],[8,12]].

Example 2

Input:intervals = [[0,1],[1,3],[4,6],[5,8]]

Output:[[0,3],[4,8]]

For input intervals = [[0,1],[1,3],[4,6],[5,8]], overlapping ranges are combined, which produces the merged result [[0,3],[4,8]]. Therefore, return [[0,3],[4,8]].

Constraints

1 <= intervals.length <= 10⁴
intervals[i].length == 2
0 <= start <= end <= 10⁵

solution.js

Test Cases (2)

Test Case 1

Input:

[[1,3],[2,6],[8,10],[9,12]]

Expected Output:

[[1,6],[8,12]]

Test Case 2

Input:

[[0,1],[1,3],[4,6],[5,8]]

Expected Output:

[[0,3],[4,8]]