Merge overlapping intervals (Python) | Dataford Interview Questions

Merge overlapping intervals.

Asked in the coding round stage. Coding half of the DE coding round.

Task

Implement merge_intervals(intervals). Each interval is an inclusive [start, end] pair. Return a new list sorted by start, merging intervals that overlap or are directly adjacent, so [1, 3] and [4, 6] become [1, 6].

Input and Output

intervals is a list of integer pairs. Return a list of merged integer pairs. The input may be unsorted and must not be assumed to contain disjoint intervals.

Constraints

0 <= len(intervals) <= 1000
Each interval has exactly two integers
start <= end
Intervals may be unsorted
Intervals are inclusive, and adjacent intervals are merged

Function Signature

def merge_intervals(intervals):

Your question is Merge overlapping intervals (Python). Start with the requirements in the Question tab.

Run and submit as often as you like. When you're ready, talk me through your approach or go straight to the code.

Problem