What is the time and space complexity of Meeting Rooms?

Time complexity: O(n log n). Space complexity: O(1).

Meeting Rooms

Easy

Code

Loading editor...

Tap Analyze to see visualization

Click Analyze to visualize

See step-by-step execution, variables, and output

Variables

Run code to see variables

Output

Console output will appear here

Press Space to start•← → to step•? all shortcuts

Solution Guide: Meeting Rooms

Approach

Sort meetings by start time. Then check each consecutive pair: if any meeting starts before the previous one ends, there is a conflict. This is the simplest interval overlap detection.

Complexity Analysis

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

Pattern

Sort + Linear Scan

Why It Works

Sorting by start time means the only possible overlaps are between consecutive meetings. If meeting B starts before meeting A ends (prev.end > curr.start), they overlap. One pass after sorting is sufficient.

Updated Mar 2026