Merge Intervals

Try to solve the Merge Intervals problem.

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 the overlapping intervalsOverlapping intervals are two or more intervals with at least one common point in time. and return a new output array consisting of only the non-overlapping intervals.

Constraints:

  • 11 \leq intervals.length 103\leq10^3

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

  • 00\leq starti \leq endi 104\leq10^4

Examples

Create a free account to view this lesson.

Continue your learning journey with a 14-day free trial.

By signing up, you agree to Educative's Terms of Service and Privacy Policy