Merge Dispatch Time Intervals | Dataford Interview Questions

Write a function to merge overlapping time intervals for vehicle dispatch schedules. Implement merge_intervals(intervals), where intervals is a list of [start, end] pairs, and return a new list of merged pairs sorted by start time. Intervals that touch, such as [1, 3] and [3, 5], should merge; return [] for empty input.

Constraints

0 <= len(intervals) <= 1000
Each interval contains exactly two integers, start and end
start <= end for every interval
-10^9 <= start <= end <= 10^9
The output must be sorted by interval start time

Function Signature

def merge_intervals(intervals):

Your question is Merge Dispatch Time Intervals. 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

Constraints

0 <= len(intervals) <= 1000
Each interval contains exactly two integers, start and end
start <= end for every interval
-10^9 <= start <= end <= 10^9
The output must be sorted by interval start time

Function Signature

def merge_intervals(intervals):

Your question is Merge Dispatch Time Intervals. 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.