Skip to content

problem16.md

Latest commit

 

History

History
12 lines (9 loc) · 433 Bytes

problem16.md

File metadata and controls

12 lines (9 loc) · 433 Bytes

Problem 16: Conflict Minimization

Problem Statement

Given an array of intervals where intervals[i] = [start_i, end_i], return the minimum number of intervals you need to remove to make the rest of the intervals non-overlapping.

Input Format

  • A 2D array of intervals.

Example

Input: intervals = [[1, 2], [2, 3], [3, 4], [1, 3]]
Output: 1
Explanation: Removing [1, 3] makes the rest non-overlapping.