Merge Intervals

Problem

Merge all overlapping intervals in a list and return the non-overlapping result.

Example

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

Constraints

• 1 ≤ n ≤ 10^4

Follow-up

Streaming intervals — maintain merged set as intervals arrive. Discuss the data structure.