Meeting Rooms II - LeetCode 253 Python

[@kairu86]

After so many tutorials never explaining "why" we're comparing min end time to next start time, I FINALLY get it. Thank you!

[@DEEPTITALESRA]

AHH so glad to hear that!! Thanks sm Kyle!!:))

[@immabe_kind]

this is super!! love it - love the way you walk through the examples step by step!

[@manishamanohar9852]

I love your explanations! Especially when you walk through the code after you're done!

[@DEEPTITALESRA]

So glad to hear that!! Thank you so much Manisha!!!:))

[@raunakthakur7004]

Deepti among all the LC you tubers I like how you explain and walk us through an example. Also I use Python so i am so grateful to your videos.

[@DEEPTITALESRA]

Ahhh thank you so much Raunak!! Love to hear it!!:))

[@jojo23srb]

this was definitely the best most intuitive vid i could find on this problem. thank you!!

[@DEEPTITALESRA]

Aw thx so much - love to hear it!:))

[@jasonliu3202]

Your explanation with an intuitive example makes your video super clear. Logic is clear and just save me a lot of time to understand this problem. However, there is one small mistake is that you don't need to keep the max heap deepth as you never pop without a push. I really appreciate your video. Thanks!

[@PATRICKCHUAD]

very clear explanation. Thanks for sharing !

[@DEEPTITALESRA]

yasss!! thank you sm!!

[@aldoushuxley8610]

thank you , the best explanation for this question❤

[@soulmusic7664]

very interesting and nice explanation .thank you for explaining so clearly and loved the walkthrough..

[@DEEPTITALESRA]

ofcc thank you so much!!:))

[@moorchini]

Love your dark background 👍👍🥂

[@DEEPTITALESRA]

Dark ides all the wayyyyy

[@kshitishsorte2918]

thank you so much. I implemented this in C after seeing your explaination.

[@DEEPTITALESRA]

ofc love to hear that Kshitish!:)

[@michaelsiu8353]

Thanks - this explanation was great

[@DEEPTITALESRA]

Thanks so much Michael!:))

[@venkatasriharsha4227]

Great explanation 🤩

[@DEEPTITALESRA]

Thanks sm Venkata!!:)

[@emmawu8137]

Thank you so much for the amazing answer! I'm wondering if it is ok to remove lines 5 and 11, and just return len(heap), it works in leetcode but I just want to confirm with you😊

[@rojo_pes75]

Yo bro🫡🐐amazing explanation

[@samsonkolge3627]

Enjoyed this one too.

[@DEEPTITALESRA]

Yay!!:)) ty Samson!

[@sanooosai]

great thank you

[@chandrasekhar-kh7br]

well explained

[@DEEPTITALESRA]

thx Chandra!:))

[@lomnguyen8598]

yayyyy

[@rifatrahman4906]

I just wanna say you are really so cuteeee!!

[@divyatalesra4767]

super helpful!!!!!

[@DEEPTITALESRA]

THANK YOUUUU

[@Kuntalsh]

Found a way without heap. What do you think ?
starttime = sorted(i[0] for i in numbers)
endtime = sorted(i[1] for i in numbers)
starp = 0
endp = 0
usedrooms = 0
L = len(numbers)
while starp < L:
if starttime[starp] >= endtime[endp]:
usedrooms-=1
endp+=1
else:
usedrooms+=1
starp+=1
print(usedrooms)

[@DEEPTITALESRA]

Hey Kuntal! I think this is def an interesting approach! I'd recommend running it directly in leetcode to see the errors/debug. As it is right now, I believe it won't produce the right answer. Correct me if I'm wrong, but sorting separately for the start and end times breaks up the intervals, and we won't be able to see how many rooms would be needed. Are you simply trying to see overlap right now? Love that you are exploring alternative solutions though!!:)

[@Kuntalsh]

@@DEEPTITALESRA thanks for the reply. I did try on leetcode and it got accepted. Yes, I just try to see the overlap and if not, not increasing the count.

[@DEEPTITALESRA]

@@Kuntalsh OOhh I see! That's also a nice solution that works in O(nlogn) and O(n) time and space!

[@justdavid7107]

damn she fine

[@walidzein1]

WHY THE FUCK WE NEED A MIN HEAP

[@TheSadhguruSense]

Dislike for low volume 😢

[@DEEPTITALESRA]

lol you can increase volume on RUclips on the bottom left of the bar - let me know if that helps!

[@TheSadhguruSense]

@@DEEPTITALESRA no mam it doesn't 😞