human
Solve in Python:
Given a collection of intervals, find the minimum number of intervals you need to remove to make the rest of the intervals non-overlapping.

Note:

You may assume the interval's end point is always bigger than its start point.
Intervals like [1,2] and [2,3] have borders "touching" but they don't overlap each other.


Example 1:

Input: [ [1,2], [2,3], [3,4], [1,3] ]

Output: 1

Explanation: [1,3] can be removed and the rest of intervals are non-overlapping.


Example 2:

Input: [ [1,2], [1,2], [1,2] ]

Output: 2

Explanation: You need to remove two [1,2] to make the rest of intervals non-overlapping.


Example 3:

Input: [ [1,2], [2,3] ]

Output: 0

Explanation: You don't need to remove any of the intervals since they're already non-overlapping.
assistant
#Here is Python program to find the minimum number of intervals you need to remove to make the rest of the intervals non-overlapping.

# Definition for an interval.
 # class Interval:
 #     def __init__(self, s=0, e=0):
 #         self.start = s
 #         self.end = e
 
 class Solution:
     def eraseOverlapIntervals(self, intervals):
         """
         :type intervals: List[Interval]
         :rtype: int
         """
         start_end={}
         for i in intervals:
             if i.start in start_end:
                 if start_end[i.start]>i.end:
                     start_end[i.start]=i.end
             else:
                 start_end[i.start]=i.end
         final_list={}
         if len(start_end)>1:
             sorted_list=sorted(start_end)
 
             for i,j in enumerate(sorted_list):
                 if i>0:
                     start2=j
                     #if j>-90 and j<-80:
                     #    print(start1,end1,start2,start_end[start2])
                     if start2<end1:
                         if start_end[start2]<end1:
                             final_list.pop(start1,None)
                             end2=start_end[start2]
                             final_list[start2]=end2
                             end1=end2
                             start1=start2
                             #if j>-90 and j<-80:
                             #    print(start1,end1)
                         elif end1<=start_end[start2]:
                             final_list[start1]=end1
                             end1=end1
                             start1=start1
                             #if j>-90 and j<-80:
                             #    print(start1,end1)
                     elif start2>=end1:
                         final_list[start1]=end1
                         start1=start2
                         end1=start_end[start2]
                         if i==len(sorted_list)-1:
                             final_list[start2]=start_end[start2]
                 if i==0:
                     start1=j
                     end1 =start_end[j]
         elif len(start_end)==1:
             final_list=start_end
        ...