Tap here to switch tabs
Problem
Submissions

Problem: Meeting Rooms II

Meeting Rooms II gives an array of meeting intervals and asks for the minimum number of rooms needed to host them all, with an interval's end time treated as exclusive.

Statement

We are given an input array of meeting time intervals, intervals, where each interval has a start time and an end time. Your task is to find the minimum number of meeting rooms required to hold these meetings.

An important thing to note here is that the specified end time for each meeting is exclusive.

Constraints

  • 1<=1 <= intervals.length <=103<= 10^{3}
  • 00 ≤\leq startistart_{i} <\lt endiend_{i} ≤\leq 10610^{6}
⋮
Tap here to switch tabs
Problem
Submissions

Problem: Meeting Rooms II

Meeting Rooms II gives an array of meeting intervals and asks for the minimum number of rooms needed to host them all, with an interval's end time treated as exclusive.

Statement

We are given an input array of meeting time intervals, intervals, where each interval has a start time and an end time. Your task is to find the minimum number of meeting rooms required to hold these meetings.

An important thing to note here is that the specified end time for each meeting is exclusive.

Constraints

  • 1<=1 <= intervals.length <=103<= 10^{3}
  • 00 ≤\leq startistart_{i} <\lt endiend_{i} ≤\leq 10610^{6}