Merge Intervals

Problem Given an array of intervals, merge all overlapping intervals and return the non-overlapping set.

Input / Output

• Input: array of intervals [start, end].
• Output: the merged, non-overlapping intervals.

Constraints

• 1 ≤ intervals.length ≤ 10^4.
• Intervals may be given in any order.

Example

• [[1,3],[2,6],[8,10],[15,18]] → [[1,6],[8,10],[15,18]].