Merge Overlapping Intervals

MediumPython00:00

Practice interviewer

In session

5 left

00:00

Your question is Merge Overlapping Intervals. Start with the requirements on the right.

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

You need to log in / sign up to run or submit.

Problem

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 solutionPython 3

You need to log in / sign up to run or submit.

Run your code to see test output