#####   ######  #####    ###    #   #  ###  #   #  ######
##  ##  ##      ##  ##  ## ##   #   #   #   #   #  ##
#####   ####    #####   #   #   #   #   #   #   #  ####
##  #   ##      ##      ## ##    # #    #    # #   ##
##   #  ######  ##       ###      #    ###    #    ######

$ curl repovive.com/roadmaps/greedy-algorithms/activity-selection/meeting-rooms-ii-implementation

░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░█████████████████████████████████████████████████████████████████████████████████████████████████

#####   ######  #####    ###    #   #  ###  #   #  ######
##  ##  ##      ##  ##  ## ##   #   #   #   #   #  ##
#####   ####    #####   #   #   #   #   #   #   #  ####
##  #   ##      ##      ## ##    # #    #    # #   ##
##   #  ######  ##       ###      #    ###    #    ######

$ curl repovive.com/roadmaps/greedy-algorithms/activity-selection/meeting-rooms-ii-implementation

Repovive

Meeting Rooms II - Implementation - Activity Selection | Greedy Algorithms | Repovive

Repovive.

Greedy Algorithms8 sections · 317 units14h total

Open in Course

Meeting Rooms II - Implementation

The code

function minMeetingRooms(intervals)
 if length of intervals = 0 then
 return 0
 sort intervals by start time ascending
 heap := min-heap containing intervals[0].end
 for i from 1 to length of intervals - 1
 if intervals[i].start >= heap.min() then
 heap.pop()
 heap.push(intervals[i].end)
 return heap.size()

Time: $O(n \log n)$ . Space: $O(n)$ for heap.