Compute minimum rooms for meeting schedule

Q: Compute minimum rooms for meeting schedule

This question evaluates a candidate's competency in interval-based scheduling and resource allocation, assessing understanding of overlapping time intervals and the management of concurrent events.

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

Loading...

Problem

You are given a list of meetings, where each meeting is represented as a pair of integers [start, end] (with start < end) indicating the meeting start time (inclusive) and end time (exclusive).

Return the minimum number of conference rooms required so that all meetings can take place without overlaps in the same room.

Input

meetingTimings : List<List<Integer>> , where each inner list has exactly two integers [start, end] .

Output

An integer: the minimum number of rooms required.

Notes / Assumptions

If one meeting ends at time t and another starts at time t , they do not overlap and can use the same room.
The input may be unsorted.

Example

Input: [[0, 30], [5, 10], [15, 20]]
Output: 2

Constraints (reasonable interview assumptions)

1 <= n <= 10^5
Time values fit in 32-bit integers.