Merge Overlapping Intervals | Dataford Interview Questions

Merge Overlapping Intervals

Medium

CodingArraysSearchingSorting

Asked 1mo ago|

Problem

Given a collection of intervals, merge all overlapping intervals and return an array of the non-overlapping intervals that cover all the intervals in the input.

Input

A list of intervals, where each interval is represented as a list of two integers [start, end].

Output

A list of merged intervals, where each interval is represented as a list of two integers.

Constraints

1 <= intervals.length <= 10^4
0 <= intervals[i][0] <= intervals[i][1] <= 10^4

Function Signature

def merge_intervals(intervals):

You are practicing as a guest. Sign up free to run your code against the sample data. Your draft stays right here.

def solve(rows):
    counts = {}
    for row in rows:
        ...
    return result

Next questions

Merge Overlapping Time IntervalsEasy

Merge Overlapping Time IntervalsEasy

Merge Overlapping IntervalsEasy

Python 3.10