MEETING ROOMS III | LEETCODE # 2402 | PYTHON HEAP SOLUTION

Discord Community: / discord
Problem Link: leetcode.com/problems/meeting...
In this video we are solving yet again another one of these Meeting Room problems: Meeting Rooms III (Leetcode 2402).
Currently being asked at Google and is very similar to the other ones except now there's a bunch of annoying restrictions on us about how and when we can schedule a meeting.
We'll still want to use a heap for our solution though now we have to be a little bit more clever given the new restrictions posed on us.
TIMESTAMPS
00:00 Intro
00:15 Question Prompt
01:27 Basic Example
04:41 Basic Intuition
07:55 Coding
16:00 Time/Space Complexity

[@devashishubale1565]

Best explanation for this problem on youtube. Thanks

[@erange5430]

Great video! Even the bug part was really good! It confirmed that I understand the solution :)

[@prerakchoksi2379]

great explaination thanks!!!

[@achyutupadhyay8438]

Great Video! Quick question: Wont the space complexity be O(n), n = number of rooms? Cause you're updating the end time of the rooms for busy and available and count are also storing the rooms.

[@aaditya_87]

TIL, tuple elements can be accessed in the same way as array elements

[@aishwariyaaish8305]

Thanks alot for putting so much effort to make our interview preparation less hectic. can you solve this question **2421 Number of Good Paths Hard**

[@crackfaang]

It's on my list, will likely do it in January

[@ZubairKhan-fw9dp]

first