Merge Intervals

Problem

Merge overlapping intervals.

Example

[[1,3],[2,6],[8,10]] -> [[1,6],[8,10]]

Constraints

• 1 ≤ n ≤ 10^4

Approach

Sort, sweep. Loom phone screens are medium LeetCode.