#134 Medium Time O(n log n) Space O(n) Animated

Meeting Rooms II

Find minimum number of conference rooms required.

LeetCode ↗

Approach: Two Pointers (Start/End arrays)

Click play to start

Step 0 / 0

Press play to start the visualization.

1×

Description

Find minimum number of conference rooms required.

Constraints

Time Complexity: O(n log n)
Space Complexity: O(n)

Solution — Two Pointers (Start/End arrays)

O(n log n) O(n)

def minMeetingRooms(intervals):
    start = sorted([i[0] for i in intervals])
    end = sorted([i[1] for i in intervals])
    
    res, count = 0, 0
    s, e = 0, 0
    while s < len(intervals):
        if start[s] < end[e]:
            s += 1
            count += 1
        else:
            e += 1
            count -= 1
        res = max(res, count)
        
    return res

Meeting Rooms

Minimum Interval to Include Each Query

Meeting Rooms II

Steps

Description

Constraints

Tags

Solution — Two Pointers (Start/End arrays)