<garvit244>253_1.py
def minMeetingRooms( intervals):
    if not intervals or len(intervals) == 0:
        return 0
    
    import heapq
    
    sorted_intervals = sorted(intervals, key=lambda it:(it.start, it.end))
    heap, result = [], 0
    
    for interval in sorted_intervals:
        start, end = interval.start, interval.end
    
        while heap and heap[0] <= start:
            heapq.heappop(heap)
    
        heapq.heappush(heap, end)
    
        result = max(result, len(heap))
    return result
def sample_funcname ( var_0 ) :
    if not var_0 or len ( var_0 ) == 0 :
        return 0
    import var_3
    var_9 = sorted ( var_0 , var_5 = lambda var_6 : ( var_6.start , var_6.end ) )
    var_10 , var_11 = [ ] , 0
    for var_12 in var_9 :
        start , end = var_12.start , var_12.end
        while var_10 and var_10 [ 0 ] <= start :
            var_3.heappop ( var_10 )
        var_3.heappush ( var_10 , end )
        var_11 = max ( var_11 , len ( var_10 ) )
    return var_11
