Non-overlapping Intervals

You are given a list of intervals, where each interval is a list [start, end] with start < end. Two intervals are considered overlapping if they share any point in common (including endpoints). Your task is to find the minimum number of intervals you need to remove so that the remaining intervals are pairwise non-overlapping. Implement the function `erase_overlap_intervals(intervals)` that takes a list of intervals and returns an integer: the minimum number of intervals to remove. **Input:** A list of lists, each inner list has exactly two integers [start, end] with start < end. The list may be empty. **Output:** An integer. **Constraints:** - 0 <= len(intervals) <= 10^4 - -10^9 <= start < end <= 10^9 **Note:** You do not need to actually remove intervals; just compute the minimum number needed.

>>> erase_overlap_intervals([[1,2],[2,3],[3,4],[1,3]])
1
>>> erase_overlap_intervals([[1,2],[1,2],[1,2]])
2
>>> erase_overlap_intervals([[1,2],[2,3]])
0
>>> erase_overlap_intervals([])
0