Merge Intervals

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

Domain

Python

Difficulty

hard

Problem

A pipeline scheduler stores job windows as [start, end] intervals and needs to detect and merge overlapping runs. Merge any overlapping or adjacent intervals and return the merged list sorted by start time.

Practice This Problem

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