comefrom: <garvit244>253_1.py
code: 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
masked: def sample_funcname ( var_0 ) :
      if not var_0 or len ( var_0 ) == 0 :
          return 0
      import var_1
      var_4 = sorted ( var_0 , var_2 = lambda var_3 : ( var_3.start , var_3.end ) )
      var_5 , var_6 = [ ] , 0
      for var_7 in var_4 :
          start , end = var_7.start , var_7.end
          while var_5 and var_5 [ 0 ] <= start :
              var_1.heappop ( var_5 )
          var_1.heappush ( var_5 , end )
          var_6 = max ( var_6 , len ( var_5 ) )
      return var_6
  