Merge Intervals - Coding Interview Problem
Last modified: April 6, 2023
Problem
Given an array 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.
Constraints
1 <= intervals.length <= 10^4intervals[i].length == 20 <= start_i <= end_i <= 10^4
Example
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].
Example 1
Input: intervals = [[1,3],[2,6],[8,10],[15,18]]
Result: [[1,6],[8,10],[15,18]]
Example 2
Input: intervals = [[1,4],[4,5]]
Result: [[1,5]]
Example 3
Input: intervals = [[1,3],[5,7],[2,4],[6,8]]
Result: [[1,4],[5,8]]