Non-overlapping Intervals

#435
Medium
Intervals
O(n log n)
O(1)
Amazon
Microsoft
Facebook
View on LeetCode

Problem Description

Given an array of intervals, return the minimum number of intervals you need to remove to make the rest of the intervals non-overlapping.