Grokking Data Structures & Algorithms for Coding Interviews
Ask Author
Back to course home

0% completed

Vote For New Content
Meeting Rooms II (medium)
On this page

Problem Statement

Given an array of meeting intervals where intervals[i] = [start<sub>i</sub>, end<sub>i</sub>], return the minimum number of meeting rooms needed so that no meetings overlap.

Examples

Example 1:

  • Input: intervals = [[10, 15], [20, 25], [30, 35]]
  • Expected Output: 1
  • Justification: There are no overlapping intervals in the given list. So, only 1 meeting room is enough for all the meetings.

Example 2:

  • Input: intervals = [[10, 20], [15, 25], [24, 30], [5, 14], [22, 28], [1, 4], [27, 35]]

.....

.....

.....

Like the course? Get enrolled and start learning!

On this page