Merge Overlapping Intervals | Dataford Interview Questions

Optimize a function to merge overlapping intervals in a large dataset.

Implement merge_intervals(intervals), where each interval is a two-element list [start, end]. Return a new list containing non-overlapping intervals that cover the same ranges, merging intervals when the next start is less than or equal to the current end.

Constraints

0 <= len(intervals) <= 1000
Each interval contains exactly two integers, [start, end]
start <= end for every interval
-10^9 <= start <= end <= 10^9
Intervals that touch at an endpoint are merged

Function Signature

def merge_intervals(intervals):

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

Optimize a function to merge overlapping intervals in a large dataset.

Constraints

0 <= len(intervals) <= 1000
Each interval contains exactly two integers, [start, end]
start <= end for every interval
-10^9 <= start <= end <= 10^9
Intervals that touch at an endpoint are merged

Function Signature

def merge_intervals(intervals):

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