Merge Overlapping Time Ranges

A medium Python interview practice problem on DataDriven. Write and execute real python code with instant grading.

Domain

Python

Difficulty

medium

Seniority

L5

Problem

Given a list of [start, end] intervals, merge overlapping ones and return the merged list of [start, end] intervals sorted by start ascending. Two intervals overlap when one starts at or before the other ends (so adjacent intervals like [1, 3] and [3, 5] merge into [1, 5]); a merged interval spans the minimum start and maximum end of its group. The input is not necessarily sorted and may be empty (return an empty list). Each result interval must be a list of two ints, and the output must be a list of lists.

Summary

Intervals piling up. Clean the timeline.

Practice This Problem

Solve this Python problem with real code execution. DataDriven runs your Python code in a real environment and grades it automatically.