Merge Overlapping Dispatch Slots | Dataford Interview Questions

Write a function to merge overlapping intervals, representing time slots for driver dispatches. Treat each interval as [start, end]; intervals that overlap or touch must be combined. Implement def merge_intervals(intervals):, accepting a list of two-element lists and returning a new list of merged intervals in ascending order. Assume start <= end for every interval.

Constraints

0 <= intervals.length <= 1000
Each interval contains exactly two integers
start <= end for every interval
-10^9 <= start, end <= 10^9
Intervals that touch at an endpoint must be merged

Function Signature

def merge_intervals(intervals):

Your question is Merge Overlapping Dispatch Slots. 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 <= intervals.length <= 1000
Each interval contains exactly two integers
start <= end for every interval
-10^9 <= start, end <= 10^9
Intervals that touch at an endpoint must be merged

Function Signature

def merge_intervals(intervals):

Your question is Merge Overlapping Dispatch Slots. 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.