Non-overlapping Intervals

Understand how to determine the minimum number of intervals that must be removed to ensure no overlaps remain. Learn to identify overlapping half-open intervals and implement an optimal O(n log n) time and O(1) space solution for coding interviews.

We'll cover the following...

Statement
Examples
Understand the problem
Try it yourself

Statement

Given an array of intervals where intervals[i] contains the half-open intervalAn interval that contains only one of its boundary elements. The “(” parenthesis denotes the exclusion of the starting point. The “]” bracket denotes the inclusion of the ending point., $(start_{i}, end_{i}]$ , your task is to find the minimum number of intervals you need to remove to make the rest of the intervals non-overlapping.

Note: Two intervals $(a, b]$ and $(c, d]$ ...