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.
Asked at 6 companies
AmazonAppleBloomberg
Hints
1.Think about what data structure fits Non Overlapping Intervals
2.Consider the brute force complexity and how to optimize