Merge Intervals

Problem Given a collection of intervals [start, end], merge all overlapping intervals and return the non-overlapping set that covers exactly the same ranges.

Input / Output

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

Constraints

• 1 ≤ n ≤ 10^4.
• Intervals may arrive in any order; touching intervals like [1,2] and [2,3] are typically merged.

Example

• [[1,3],[2,6],[8,10],[15,18]] -> [[1,6],[8,10],[15,18]]