Meeting Rooms II

Problem Link 1: https://leetcode.com/problems/meeting-rooms-ii/

Problem Link 2: https://www.lintcode.com/problem/919/

class Solution:
    """
    @param intervals: an array of meeting time intervals
    @return: the minimum number of conference rooms required
    """
    def min_meeting_rooms(self, intervals: List[Interval]) -> int:
        # Write your code here
        n=len(intervals)
        sarr=[]
        earr=[]
        for i in intervals:
            sarr.append(i.start)
            earr.append(i.end)
        sarr.sort()
        earr.sort()
        i=0
        j=0
        ans=0
        c=0
        while(i<n):
            if(sarr[i]<earr[j]):
                i+=1
                c+=1
            else:
                j+=1
                c-=1
            ans=max(ans,c)
        return ans