Compute minimum rooms for time intervals

Q: Compute minimum rooms for time intervals

This question evaluates understanding of interval overlap, resource allocation and the ability to implement efficient scheduling algorithms for meeting-room assignment.

Q: How do I approach Coding & Algorithms interview questions?

Coding & Algorithms questions require understanding of core concepts and practice. PracHub provides solutions with explanations to help you master coding & algorithms interviews.

Question

You are given a list of meeting time intervals, where each interval is represented as [start, end) (start time inclusive, end time exclusive) and start < end.

Two meetings overlap if one starts before the other ends.

Task: Return the minimum number of conference rooms required so that all meetings can be held without conflicts.

Input

intervals : an array of n intervals, each interval is a pair of integers [start, end) .

Output

An integer: the minimum number of rooms needed.

Constraints (typical interview constraints)

1 <= n <= 10^5
0 <= start < end <= 10^9

Example

Input: [[0,30],[5,10],[15,20]]
Output: 2 (because at time 5–10, two meetings overlap)

Compute minimum rooms for time intervals

Quick Overview

Input

Output

Constraints (typical interview constraints)

Example

Comments (0)