← All practice problems

Merge overlapping intervals

senior · python🔒Walkthroughs

NEW

Merge overlapping intervals

Given a list of (start, end) integer tuples (in any order), merge all overlapping or touching intervals and return the result as a list of (start, end) tuples sorted ascending by start.

Rules: - Two intervals merge if they overlap OR touch — i.e. the next interval's start is <= the current interval's end (so (1,3) and (3,5) become (1,5)). - A fully contained interval is absorbed ((1,10) swallows (2,3)). - The input is not sorted. Empty input returns [].

Python 3.12, standard library only — no pip installs.

solution.py

Preparing runtime…

Loading editor…