Tap here to switch tabs
Problem
Submissions

Problem: Merge Intervals

Merge Intervals gives you an array of closed time intervals and asks you to combine every group that overlaps, returning non-overlapping intervals that still cover the entire input.

Statement

We are given an array of closed intervalsclosedintervals called intervals, where each interval has a start time and an end time and is represented as intervals[i] = [starti, endi]. Your task is to merge all the overlapping intervalsOverlapping intervals are two or more intervals with at least one common point in time. and return an array of the resulting non-overlapping intervals that cover all the intervals in the input.

Constraints:

  • 1≤1 \leq intervals.length ≤103\leq10^3

  • intervals[i].length ==2== 2

  • 0≤0\leq starti ≤\leq endi ≤104\leq10^4

⋮
Tap here to switch tabs
Problem
Submissions

Problem: Merge Intervals

Merge Intervals gives you an array of closed time intervals and asks you to combine every group that overlaps, returning non-overlapping intervals that still cover the entire input.

Statement

We are given an array of closed intervalsclosedintervals called intervals, where each interval has a start time and an end time and is represented as intervals[i] = [starti, endi]. Your task is to merge all the overlapping intervalsOverlapping intervals are two or more intervals with at least one common point in time. and return an array of the resulting non-overlapping intervals that cover all the intervals in the input.

Constraints:

  • 1≤1 \leq intervals.length ≤103\leq10^3

  • intervals[i].length ==2== 2

  • 0≤0\leq starti ≤\leq endi ≤104\leq10^4