Given `intervals` as `[start, end]` pairs, implement `eraseOverlapIntervals(intervals)` returning the minimum number of intervals to remove so the rest do not overlap.
+ 1 hidden test run on Submit.
Greedily keeping earliest-ending non-overlapping intervals minimizes removals in O(n log n) time.
Run your code to see results.