Zero To DSAZero To DSA
Privacy Policy
Non-Overlapping Intervals

Merge Intervals

medium
Time: O(n log n)
Space: O(n)

Given an array of intervals where each interval is [start, end], merge all overlapping intervals.

Constraints

  • 1 <= intervals.length <= 10⁴

Examples

Input: intervals = [[1,3],[2,6],[8,10],[15,18]]
Output: [[1,6],[8,10],[15,18]]
Intervals [1,3] and [2,6] overlap, merged to [1,6].
Input: intervals = [[1,4],[4,5]]
Output: [[1,5]]