Meeting Rooms III | Detailed Intuition | Brute Force | Optimal | Leetcode 2402

iPad PDF Notes - github.com/MAZHARMIK/Intervie...
Whatsapp Community Link : www.whatsapp.com/channel/0029...
This is the 84th Video of our Playlist "Array 1D-2D : Popular Interview Problems".
We will try to understand the thought process behind solving interview based problems and also see 2 Approaches for this.
Problem Name : Meeting Rooms III | Leetcode 2402
Company Tags : GOOGLE
My solutions on Github : github.com/MAZHARMIK/Intervie...
Leetcode Link : leetcode.com/problems/meeting...
Approach Summary :
Approach-1 (Brute Force - Do as said):
This approach sorts meetings by their starting times and iterates through them.
It maintains vectors to track each room's last available time and the count of times each room is used.
For each meeting, it finds the first available room or the room with the earliest availability if no room is available.
The result is the room with the highest usage count.
Approach-2 (Use priority Queue to find the first available meeting room):
Similar to Approach-1, it sorts meetings by starting times.
It employs two priority queues: usedRooms to store occupied rooms with their earliest empty times and unusedRooms to manage available rooms.
It iterates through meetings, updating room availability using priority queues.
If a room is available, it is marked as used; otherwise, it finds the room with the earliest available time and updates its availability.
The result is the room with the highest usage count.
Both approaches efficiently handle meeting scheduling and room availability to determine the most booked room, with Approach-2 using priority queues for optimization.
My Recursion Concepts Playlist : • Introduction | Recursi...
My DP Concepts Playlist : • Roadmap for DP | How t...
My Graph Concepts Playlist : • Graph Concepts & Qns -...
My GitHub Repo for interview preparation : github.com/MAZHARMIK/Intervie...
Subscribe to my channel : / @codestorywithmik
Instagram : / codestorywithmik
Facebook : / 100090524295846
Twitter : / cswithmik
╔═╦╗╔╦╗╔═╦═╦╦╦╦╗╔═╗
║╚╣║║║╚╣╚╣╔╣╔╣║╚╣═╣
╠╗║╚╝║║╠╗║╚╣║║║║║═╣
╚═╩══╩═╩═╩═╩╝╚╩═╩═╝
Timelines : ⏰
00:00 - Problem Explanation using Example
04:50 - Do as asked (Brute Force) + Story
22:33 - Code Brute Force
34:15 - Optimal Approach Intuition
38:59 - Build story for Optimal
52:45 - Time and Space Complexity
54:00 - Coding it up
#coding #helpajobseeker #easyrecipes #leetcode #leetcodequestionandanswers #leetcodesolution #leetcodedailychallenge #leetcodequestions #leetcodechallenge #hindi #india #coding #helpajobseeker #easyrecipes #leetcode #leetcodequestionandanswers #leetcodesolution #leetcodedailychallenge#leetcodequestions #leetcodechallenge #hindi #india #hindiexplanation #hindiexplained #easyexplaination #interview#interviewtips #interviewpreparation #interview_ds_algo #hinglish #github #design #data #google #video #instagram #facebook #leetcode #computerscience #leetcodesolutions #leetcodequestionandanswers #code #learning #dsalgo #dsa #2024 #newyear

[@pratiksahu1539]

Thank you so much sir!

[@codestorywithMIK]

This means a lot. Thank you Pratik for this kind gesture ❤️

[@saanchit1]

Again, mark my words, this channel will surpass Neetcode/striver's subscribers someday, pin this !

[@wearevacationuncoverers]

true 🔥

[@riyanshbiswas]

I never understood a single word striver spoke, i have no idea how people understand his videos.

[@akbar55555shaikh]

Don't compare, their content is nothing (never liked) This is an awesome channel.

[@aakritidubey5920]

Sir please never ever stop making these videos , Its because of you that I am confident enough to approach the problems on my own,specially dp ones.Thanks again sir.

[@codestorywithMIK]

Means a lot 🙏❤️ Apologies for the delay. Actually i have been occupied this weekend due to some prescheduled plans. Thank you for understanding ❤️🙏

[@simplify5251]

your explanation is even better than striver. Hats Off man. Keep teaching

[@swarnavachakrabarti8970]

Your videos are the definition of phenomenal teaching. Every step of explanation is awesome

[@codestorywithMIK]

It means a lot Apologies for the delay. Actually i have been occupied this weekend due to some prescheduled plans. Thank you for understanding ❤️🙏

[@wearevacationuncoverers]

indeed

[@MD_SAMEER___]

Just love the way you teach ❤ You are the most underrated teacher May Allah help you in your journey

[@himanshu_27tt]

by far the best explanation i have seen on youtube

[@vinayaksinghal]

You give the best of explanations.

[@gui-codes]

🔥 cant' express in words. i think you are clearly the best dsa content creator till now. If you had come years ago, then you would have much more subscribers than any dsa youtuber out there. I suggest everyone about your channel

[@aws_handles]

I can bet, your explanations are better than any paid platform out there, or any famous youtuber out there. Hats off

[@vivekgupta_3085]

Underrated Channel !! You make us fall in love with recursion , dp or any problem . Paid Courses se bhi better ho

[@hengulrajsaikia9227]

Dude, I almost though of the optimised solution except for the second priority queue containing the available rooms. You explained it so well.

[@abhishekkarn8918]

Next level explanation. Well done man. Absolutely amazing explanation. Don't stop giving tutorials like these. You are truly a gem.

[@abcd76820]

thanks mik , i avoid watching other tutorial from morning coz i knw when ur vdeo arrive it explains everthing in detail and i am able to code after listening ur logic. thanks a lot buddy !!!!

[@ArjunSingh-pm2vt]

Bro explained entire business model of OYO

[@factholicdunyia2049]

I'm excited to see the video. I've been checking your channel all morning. Can't wait! 😄

[@codestorywithMIK]

Thank you Apologies for the delay. Actually i have been occupied this weekend due to some prescheduled plans. Thank you for understanding ❤️🙏

[@amitshukla2268]

Thanks a lot bhaiya, subh aapki vid search kia tha iss question ke lie lekin nahi mili, dusro ka dekha toh kuch smz ni aaya ki kyu 2 min heap use kia hai , abb jakr sab kuch clear ho gya, You are a gem bhaiya ❤❤

[@EB-ot8uu]

Bawal explanation and bawal channel. Extremely underrated. This guys is a hidden legend

[@acceleratorlevel645]

the fact that the code i came up on my own was so similar to yours is a sign that i have learnt so much from you ! thank you so much for your daily lessons !

[@shivam875S]

khatarnak explaination sir keep making story to code video i love the way you approach a problem ✌✌❤❤

[@rounaq_khandelwal]

Though I spent 2 hours on this question, but I am really happy to have a strong hold over the concepts and illustrations taught in the lecture! Thanks MIK

[@user-ub2is4rs4x]

Are guruji. Ek hi dil hai, kitni baat jeetoge. Gajab parhate ho aap 🔥🔥

[@viditvaish7317]

tanq very much sir .Aap jo har ek minute cheej kaise hui aur kyu huyi uska intution dete hain vo bahut amazing hai aisa koi bhi nahi karta cheeze ekdum crystal clear ho jati hain .Thanq very very much sir

[@wearevacationuncoverers]

You are just an awesome tutor. No words to express this level of teaching. Man I am just speechless.

[@harchitgulati3065]

nice explanation sir ! I went to every channel to understand the concept but this was the best ..I easily understood

[@ugcwithaddi]

After watching many other videos since morning, this is where I get completely satisfied understanding. Thank you so much. Was waiting for your video since morning

[@Thriftinghai]

I only wait for your videos. As usual, fantastic explanation. Thank you so much

[@souravjoshi2293]

Goodness. Hats off to this detailed explanation. And thanks a lot for video tags as well.

[@kshitijgarg2609]

Best explanatory video which is fruitful

[@kshitijgarg2609]

The java solution approach 2 is stuck at one test case, the rooms are 100 and test case is quite big, so please do check that code again. Thank you so much for your consideration.

[@codestorywithMIK]

Updated and corrected. Kindly check now. Thank you ❤️🙏

[@23cash86]

Best explanation , after watching brute force I figured out the optimal on my own 👌

[@varunvarun5723]

Thanks for your amazing support

[@thor1626]

I was using a Hashmap and a pq, but could not figure out what to do when multiple rooms get free, how to select the smallest room out of them, Watched your video and the intuition hit me faster than a bullet train. Also the brute force method is great too. Thanks for these videos, also please continue the recursion series, it's too good.

[@umeshbisht1054]

Thanku bhaiya ❤❤

[@pradeepranjan8226]

loved it

[@sauravjos]

Could you also start making videos for important questions 3, 4 from Weekly contests? That would be of great help.

[@ankurtiwari9621]

Great Explanation .. Please help in providing solutions of Medium / Hard of weekly & biweekly contest..

[@mr_stranger3867]

Nice video bhaiya😁😁 Btw aap konsa pentab use krte ho sikhane ke liye ?

[@Ashu-Tosh650]

Sir you are amazing

[@nishantdehariya5769]

nice

[@bhuppidhamii]

please, also make a video on Meeting Rooms 1&2

[@ShivamTiwari-yl7xv]

Nice solution :)

[@codestorywithMIK]

Thank you 🙏 Apologies for the delay in upload today . Actually i have been occupied this weekend due to some prescheduled plans. Thank you for understanding ❤️🙏

[@tutuimam3381]

❤❤❤❤

[@user-ix8ce9cq3e]

Bhaiya Need Advice 🙏 Mai leetcode question ke approach ko thoda bahut sahi direction pe soch leta hoon but ultimately solve nhi hota aur contest mai to 2 questions tak hi hote hai 5 - 6 months se consistent bhi coding kar raha hoon abhi jaake sirf Graph pending reh raha hai bakki Leetcode POTD pichle 20 din se kar raha hoon .

[@Sahilsharma-sk5vr]

wow. wow

[@tharunkumar8133]

Hi. There is a small bug in Java code which you uploaded to github. While writing the lambda for usedRooms we need to consider a case where starting times are equal. In this case we need to again sort the array based on ending times. Without this 81/82 cases are passing. existing lambda: (a, b) -> Long.compare(a[0], b[0]) fix for it: (a,b)->Long.compare(a[0],b[0])==0 ? Long.compare(a[1],b[1]) : Long.compare(a[0],b[0])

[@codestorywithMIK]

Corrected and updated. Thanks a lot 🙏

[@shakti5521]

Very nice explanation video, please share your Dsa sheet.

[@codestorywithMIK]

Thank you 🙏 docs.google.com/spreadsheets/d/1LO1BLTebhrcRfEpPjIOutKvOFSFaFM3Ph1EjA12x_zE/edit?pli=1#gid=740761817

[@aksharbrahm4618]

Nice Explanation. I really appreciate.. But wanted to ask that why dont you write code in java ?

[@23cash86]

✌️👍👍

[@ankitsahu2305]

class Solution { public: struct myCmp { bool operator()(pair &a, pair &b) { if(a.first>b.first) return true; else if(a.first==b.first) return a.second>b.second; else return false; } }; static bool comparator(vector &a, vector &b) { return a[0]

[@adityabalachandran8675]

Hello MIK in bruteforce approach shouldnt we also need to add a break statement after we found a room as such otherwise it will also will replace other room times accidentally ? 30:33

[@sudhadevi6692]

Did u get the ans?

[@adityabalachandran8675]

@@sudhadevi6692 yeah it was solved later in the video itself

[@sudhadevi6692]

@@adityabalachandran8675 ya seen

[@gauravbanerjee2898]

Was wating for your video since morning , thank you so much bhaiya ❤❤

[@codestorywithMIK]

Apologies for the delay. Actually i have been occupied this weekend due to some prescheduled plans. Thank you for understanding ❤️🙏

[@gauravbanerjee2898]

@@codestorywithMIK No issues bhaiya, hats off to your consistency, making videos regularly with this much detailed explanation is not an easy job. You must be a pro at time management, so many things to learn from you 😇. Thanks a lot for everything. ❤❤

[@bhuppidhamii]

hello bhaiya, Meeting Rooms 1 & 2 are locked in LeetCode, can you tell us where to practice those alternatively (please share links if possible)

[@codestorywithMIK]

Find them in Lintcode

[@bhuppidhamii]

ok sir@@codestorywithMIK

[@ranvijaysharma6697]

Agar same hi priority queue me 0 se initialize krke rooms push kr de to kaam ni chalega?

[@ranvijaysharma6697]

kyuki wo to hmesaa top pr mil jayenge aur hme hmesaa min hi chahiye. index second element hai pair ka to wo index wise bhi sorted hoga room pq me. {0,0}, {0,1},{0,2}.. aise

[@ranvijaysharma6697]

kr ke dekha ni hua.. kyuki ek heap ke case me ye pehle saare empty fill krta hai.. jbki aisa ni krna hai.. used room agr available hai to wo pehle assign krna hai.

[@dayashankarlakhotia4943]

your java solution for apporach 2nd is not working in solution you room conver in int then insert pq.but your pq.long?

[@codestorywithMIK]

Corrected and updated. Thanks a lot 🙏

[@Abhay14]

bhaiya jo tummhari DSA sheet h usse drive pr upload krdo with your yt sol link

[@codestorywithMIK]

Sure thing. Let me do it today after office Thanks for your precious suggestion ❤️🙏

[@Abhay14]

and bhaiya try krna Topic wise question dalne ka like array,string, rec, dp, backtracking, linked list etc and easy medium hard bhi i know ye kafi time consuming h but it will help us a lot if you want reference pls use my sheet i make this sheet for revision purpose docs.google.com/spreadsheets/d/105oeZV6LOddHNGeBx2CEWIhFQnI62HfLODCGlRwBG90/edit#gid=0 @@codestorywithMIK

[@JagannathDebGunin]

Dada can you please do permutation ii of Leetcode? ...

[@codestorywithMIK]

Sure. I will try to bring that in my Recursion playlist asap

[@codestorywithMIK]

Also, Apologies for the delay in upload today. Actually i have been occupied this weekend due to some prescheduled plans. Thank you for understanding ❤️🙏

[@dhairyachauhan6622]

Bhaiya aaj ka contest bhaut bhura hua.... ab toh self doubt ho rha hai :( dpp toh ho jate hai fir contest kyu nhi ho paa rha 😔😔

[@anshumaan1024]

kyo kitne hue ?

[@dhairyachauhan6622]

@@anshumaan1024 2 (1 and 3)

[@dhairyachauhan6622]

@@anshumaan1024 1st and 3rd

[@codestorywithMIK]

Let me check the qns and try to upload this week. Don’t worry it happens a lot of times. Happened to me a many more time before. Also, Apologies for the delay in uoload today. Actually i have been occupied this weekend due to some prescheduled plans. Thank you for understanding ❤️🙏

[@dhairyachauhan6622]

@@codestorywithMIK bhaiya no worries for the delay thanks for keeping my sprit up :)

[@ninadbhase7071]

kindly share your SDE sheet

[@codestorywithMIK]

Thank you 🙏 docs.google.com/spreadsheets/d/1LO1BLTebhrcRfEpPjIOutKvOFSFaFM3Ph1EjA12x_zE/edit?pli=1#gid=740761817

[@Abhay14]

bhaiya i did the Min refueling stops problem class Solution { public: int minRefuelStops(int target, int startFuel, vector& stations) { int ans = 0; // total no of station where my car stop int count = 0; //this calculate the distance where my car can reach priority_queuepq; int i = 0; while(count < target){ count += startFuel; //itna travel kr paeggi meri car startFuel = 0; //fuel khtm if(count >= target) return ans; //storing all stations fuel in pq while(i < stations.size() && count >= stations[i][0]){ //yha hgegga pq.push(stations[i][1]); i++; } if(pq.empty()) return -1; startFuel += pq.top(); pq.pop(); ans++; } return ans; } };

[@rajrajesh1669]

Sir please teach in English...