The Blind 75 Leetcode Series: Non-overlapping Intervals

Jonathan Chao
3 min readNov 17, 2023
Photo by Chris Ried on Unsplash

435. Non-overlapping Intervals

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

--

--

Jonathan Chao

I am a software developer who has been in this industry for close to a decade. I share my experience to people who are or want to get into the industry