Merge intervals

Sort once, sweep calm.

intervals sort

Implement `merge_intervals(intervals: list[list[int]]) -> list[list[int]]`.

Touching intervals count as overlapping.

Constraints

0 ≤ len(intervals) ≤ 2000

Example

>>> merge_intervals([[1,3],[2,6],[8,10],[15,18]])
[[1,6],[8,10],[15,18]]

30 points ~26 min

Recent Submissions

No submissions yet — hit Run Tests to try!

Hints

Sort by start; sweep extending the current interval when it overlaps.

Test Results

Press Ctrl+Enter or click Run Tests to execute your code.