290. Meeting Rooms II - Min Heap

Medium•

This problem builds on meeting-rooms. Complete that first, then load your solution to continue.

Given an array of meeting time intervals where intervals[i] = [start, end], return the minimum number of conference rooms required.

minMeetingRooms([
  [0, 30],
  [5, 10],
  [15, 20],
]); // 2

minMeetingRooms([
  [7, 10],
  [12, 15],
]); // 1

Accepted15/18|Acceptance Rate83.3%

Loading problem…

Medium•

This problem builds on meeting-rooms. Complete that first, then load your solution to continue.

Given an array of meeting time intervals where intervals[i] = [start, end], return the minimum number of conference rooms required.

minMeetingRooms([
  [0, 30],
  [5, 10],
  [15, 20],
]); // 2

minMeetingRooms([
  [7, 10],
  [12, 15],
]); // 1

Accepted15/18|Acceptance Rate83.3%