Intervals/Non-overlapping IntervalsMedium

This practice workspace is built for desktop. Open it on a larger screen to start solving.

Non-overlapping Intervals

Intervals·Medium

Given an array of intervals 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.

Intervals that only touch at a point (e.g. [1,2] and [2,3]) are considered non-overlapping.

Examples

Input: intervals = [[1,2],[2,3],[3,4],[1,3]]

Output: 1

Remove [1,3] to make the rest non-overlapping.

Input: intervals = [[1,2],[1,2],[1,2]]

Output: 2

Input: intervals = [[1,2],[2,3]]

Output: 0

Constraints

1 <= intervals.length <= 10^5
intervals[i].length == 2
-5 * 10^4 <= start_i < end_i <= 5 * 10^4

00:00Preview Mode (Read Only)

Loading editor…

Tests

Preview Mode

This is a read-only preview of DSAMind's AI coaching. Sign up to get custom feedback on your own solution.

Passed32 ms

First attempt — retry to track metric movement here.

Your approach

Pattern:Intervals
Time:O(N)
Space:O(1)

Complete approach — pattern and complexity both named.

Coach

What you got right

You correctly matched the sorted input requirement and implemented a linear-time scan using two pointers.

Where it diverged

No divergence detected. The code correctly aligns with the stated approach.

Next attempt: focus on

Try solving related sliding window problems to build familiarity with two-pointer variants.

Signals

No signals fired — clean run, you stayed in flow.