Non-overlapping Intervals

Medium

Topics
ArrayGreedySortingIntervals

Given an array of intervals (each [start, end]), return the minimum number of intervals you must remove so the rest are non-overlapping.

Example 1

Input:  grid = [[1,2],[2,3],[3,4],[1,3]]
Output: 1

Example 2

Input:  grid = [[1,2],[1,2],[1,2]]
Output: 2

Constraints

  • 1 <= intervals.length <= 10^5
  • intervals[i].length == 2
Run ⌘' · Submit ⌘⏎