Hello Coders! In today's video, we will be talking about the follow-up question to the previous Meeting Rooms problem. We will be using a min-heap for this problem.
Runtime: O(nlogn)
Space: O(n)
This video is divided into 3 parts:
Part I: Problem description and the solution run-through 0:33
Part II: Step-by-step solution to example 2:19
Part III: Solution in steps and the actual code to the solution 5:12
Hope you enjoy this video and happy coding!
Try my LeetCode list:
https://leetcode.com/list/xbahsr4j
Let's be friends:
My Blog: jazwang.com
Email: [email protected]