Merge Intervals

Problem Given a collection of intervals, merge all overlapping intervals and return the resulting non-overlapping intervals covering the same ranges.

Input / Output

• Input: an array of intervals [start, end].
• Output: an array of merged, non-overlapping intervals, conventionally sorted by start.

Constraints

• 1 ≤ n ≤ 10^4.
• Intervals touching at an endpoint (e.g. [1,4] and [4,5]) are treated as overlapping and merged.

Example

• [[1,3],[2,6],[8,10]] → [[1,6],[8,10]].
• [[1,4],[4,5]] → [[1,5]].