#56 Merge Intervals

Medium Acceptance 0%

description

Problem Description

Given an array of `intervals` where `intervals[i] = [start_i, end_i]`, merge all overlapping intervals, and return an array of the non-overlapping intervals that cover all the intervals in the input.

checklist Constraints

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

science Examples

Case #1

In: intervals = [[1,3],[2,6],[8,10],[15,18]]

Out: [[1,6],[8,10],[15,18]]

Case #2

In: intervals = [[1,4],[4,5]]

Out: [[1,5]]

Mastery Tags

Arrays Sorting

Hiring Companies

Amazon Google Meta

code