Leetcode: Meeting Rooms II

Meeting Rooms II



Similar Problems:


Given an array of meeting time intervals consisting of start and end times [[s1,e1],[s2,e2],…] (si < ei), find the minimum number of conference rooms required.

Example 1:

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

Example 2:

Input: [[7,10],[2,4]]
Output: 1

Github: code.dennyzhang.com

Credits To: leetcode.com

Leave me comments, if you have better ways to solve.


## Blog link: https://code.dennyzhang.com/meeting-rooms-ii

linkedin
github
slack

Share It, If You Like It.

Leave a Reply

Your email address will not be published.