Merge Overlapping Intervals | Dataford Interview Questions

Given a list of intervals intervals, where each interval is a pair [start, end] with start <= end, return a new list of intervals after merging all overlapping intervals. The output should contain the smallest possible set of non-overlapping intervals covering the same ranges.

Constraints

1 <= len(intervals) <= 10^4
intervals[i].length == 2
0 <= start <= end <= 10^4
Intervals may appear in any order

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

Constraints

1 <= len(intervals) <= 10^4
intervals[i].length == 2
0 <= start <= end <= 10^4
Intervals may appear in any order

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.