My Calendar II | Simplest Explanation | Full Dry Run | Leetcode 731 | codestorywithMIK

[@kirtisharma7073]

Thank you bhaiya, I have received a full time offer from flipkart. Your videos have helped me a lot and I hope your channel grows even more….You deserve so much more love and support❤️

[@codestorywithMIK]

Wow. Many Many Congratulations 🎉🎉🎊🎊 So happy to see this.😇 Congratulations 🙌

[@souravjoshi2293]

congrats

[@rockykumarverma980]

congratulation 🎉 🎉 🥰🥰

[@thekindspill]

Congratulations

[@kushjoshi9427]

Congratulations bro

[@wearevacationuncoverers]

0:27 Are sir , please don't be sorry. We know you are the best.

[@shiveshanand5812]

Great Explanation. I was completely fine with the previous lengthy explanation, I loved that you are explaining even a simpler problem with so much details!

[@rohanmandal369]

We felt the same that it was over descriptive, but seeing you realized that , shows how good of a teacher you are 🙇🏻🙇🏻❤❤

[@codestorywithMIK]

This means a lot to me ❤️🙏

[@rajchinagundi7498]

@@codestorywithMIK Sir dont take it to your heart. You are like a big brother to us, my problem solving skills have improved a long way with your video explanations, letting you know that we still love your videos a lot.

[@itsharshita22]

Yes bhaiya kal wale explanation ke comparison mein aj wala jada simple tha 😄

[@prajitbanerjee8226]

nahi aapne sahi explain kiya tha calender-I.Your explanation was perfect because most of use dont do lower_bound on set.So your explanation was execellent.

[@codestorywithMIK]

❤️🙏

[@study-yd6es]

Thank you, bhaiya! No need to apologize-you’re doing great. Some of us might already have a good grasp of DSA and feel the explanations are a bit detailed, but I think it’s good to keep them general so beginners can understand too. For those who already know the concepts, they can just follow one example and start solving right away. That’s what I usually do-I pause after the example, solve it, and then continue with the video.

[@SrishtiKapoor-d1w]

Understood the problem really well. Was able to code myself after understanding the approach!! Thank you so much 🙂

[@dreamexcellence]

Hello sir, I watch your videos to see if there is any optimization possible in my code. Your yesterday's code helped me understand that we can use sets as well. We can use that for today's question too, right? That's why I think your yesterday's video was not overly descriptive; it was good.

[@ratneshsingh8403]

I think mai apke channel se tbse juda hoon jab apke 1K subscriber the aur jbse jud gya tbse baki sare channels bhool hi gya itna bdia explanation hota hai apka question ko approach krne ke tarike ko smjhane ka. Only kal ka problem mujhe thoda sa kam samajh me aya tha but apne aj usko akdm hlva (easy) bna dia❤. Thank you so much bhaiya for such type of explanation. This is unique channel on KZbin which is providing this type of really good content. Thank you so much again bhaiya🙏. You had make me fall in love with DSA.😅

[@codestorywithMIK]

This means a lot. Thank you so much ❤️🙏

[@gauravmundhada1647]

Used this approach to solve yesterday's problem, quite easy to understand. Please keep the video descriptive, helps to understand in depth.

[@codestorywithMIK]

Sure ❤️

[@Kaushikee1]

​@@codestorywithMIK Bhaiyaa bss video ko beginner friendly rakhna...... And thank you so much ❤❤ hme itna acha content free me provide krne ke liye ...God bless you 💐✨

[@codestorywithMIK]

Definitely. 😇🙏

[@justanuhere]

pls dont say sorry aapka calender1 explanation was amazing !!!

[@AbhijeetMuneshwar]

Respected MIK Sir, Please don’t say sorry. We’re fortunate to have a teacher like you 😇

[@futuregroup7304]

Listened to your approach and coded it own my own, it is worked in first attempt. Proud moment for me. I was always afraid of leetcode. Then I listened to a piece of advice "Solving your 100th problem won't be as difficult as solving your 1st problem" + I found your channel (It's truly a GEM). Now I am 4 days away from 300 days streak and have Improved a lot! Thanks Sir❤

[@nehasinghggpl9637]

You are damm awesome..please bhaiya never let your confidence down..

[@codestorywithMIK]

Means a lot to me ❤️🙏

[@dazlingwiz]

great explanation of the problem sir. I agree kal wala problem thhoda dimag ke upar se gya

[@codestorywithMIK]

❤️🙏

[@EB-ot8uu]

don't worry sir. we all know you are so good and no one teaches like you. You made it simple and easy to understand

[@gamingshorts6433]

Sir iss question ki Sweep Line algorithm wali approach pe bhi ek video bna do.

[@amitkumarthakur5265]

Yes, I also feel the same about yesterday's video, but no worries, every day is not your day. Btw your explanation was good.

[@harshittaneja471]

Bit simpler without creating the functions vector doublebooking; vector bookings; MyCalendarTwo() { } bool book(int start, int end) { // check if triple booking is being created or not for(int i=0;i

[@DurgaShiva7574]

God of dsa may be found, but you are the only one who is God of dsa + teaching 🎉

[@Anime-ub7vs]

After watching this video i solved calendar -1 problem . thanku bhiya

[@codestorywithMIK]

Most welcome 😊

[@vinayjoshi8714]

greatly explained 🥰🥰🥰

[@rockykumarverma980]

Thank you so much Bhaiya ji🙏🙏🙏

[@SaurabhSinghyadav-r4y]

Best explanation sir. Thank you

[@GauravDuseja-t6q]

Best explanation bhaiya

[@codestorywithMIK]

This means a lot ❤️🙏 Thank you for the feedback

[@rickdutta942]

Easy and West MIK is best💗💗

[@souravjoshi2293]

you are the best tutor

[@anuragprajapati3712]

nice explanation

[@wearevacationuncoverers]

0:27 -> This shows you not only make videos for views, but you actually care. Thanks and amazing explanation. Could solve it easily after understanding the approach

[@HarshalYallewarxWF]

nice explain

[@aniketnama8390]

hey guys here is the code of My Calendar I class MyCalendar { public: vectoroverallbooking; bool checkoverlap(int start1,int end1,int start2,int end2){ return max(start1,start2) < min(end1,end2); } MyCalendar() { } bool book(int start, int end) { for(pairregion : overallbooking){ if(checkoverlap(region.first,region.second,start,end)){ return false; } } overallbooking.push_back({start,end}); return true; } };

[@Its_Shubham_Negi]

Bhaiya Plzzz Nooo..... You dedicated your 40 minutes, not only to just solve a question, but also to explain a new concept (lower bound in pairs), which I highly appreciate. If your video would be of 1 hr, I would still love to learn a new concept from that lecture..... That lecture was not over descriptive...never never ever say sorry again 😢❤

[@aws_handles]

At 11:18, I stopped the video and coded it up 🥺 Love you MIK sir. You are the best

[@gagandeepgarg9440]

Hey your videos are awesome. This solution seems specific to triple booking. interviewer can ask for n number of booking. Can you please think of such scenario and provide solution for that. Thanks

[@brokegod5871]

Bhaiya can you make a playlist separately for intervals from your previously solved questions on this topic

[@PawanKumar-ri3eq]

My Calendar III pe bhi ek video banaiye bhaiya please...

[@ApnaPaisa-o5d]

Sir If maximum 5 overlappings are allowed then Do we have to make 5 arrays ? Please help someone that if Allowed overlappings increases then what will be the feasible approach..!? Thanks In advance.

[@HarshalYallewarxWF]

learn line sweep algorithm for n overlappings

[@lover4924]

Thank u so much sir, very nice explanation sir which app u use for teaching can please tell

[@codestorywithMIK]

Thank you. I use ipad11 pro and apple pencil and default Notes app

[@kartikkaushik4743]

Hi Mik will it be possible for you to cover the problem related GFG On Problems of the day it will be really helpful if it will be possible I am asking it because I am from mechanical branch and just started DSA by following your channels playlist

[@shaswataroy6256]

Bhaiya ek video pattern recognition pe bhi bana do jis se hame fatak se pata chal jay yehh question konsi topic se belong karta he 😁😁🙏🙏

[@anubhavsharma398]

thanks bhaiya for these wonderful solutions... Can you help me how your record good audio on ipad as I also want to start recording on my ipad?

[@jeehub041]

Ist view as always ❤ but very disheartened to not get placement 😢

[@codestorywithMIK]

Don’t worry. Keep going and it will all fall in place ❤️

[@TY_A_34_Prasad]

Please give detailed TimeLine of Video... like then we can see where you are explaining and where is the code.... in the video... I think, there is feature of KZbin to insert timelines in video... while uploading...

[@yuvrajbhati3509]

sir i think max 10 minutes for easy or medium prob and max 15 minutes for hard prob would be sufficient

[@Ash-fo4qs]

a minor suggestion - the voice of the video has lot of base. if it can be reduced

[@rachitthakur9454]

Sir can you share how to join your company as fresher from btech cse department as my subject is cyber can you please guide how to prepare for that

[@abhinay.k]

Thanks

[@aizad786iqbal]

no worries man for yesterday's video but yeah I did had doubts on how this lower and upper bound is working for an array of start,end , (JAVA) is it only taking start time into consideration ?

[@codestorywithMIK]

Sorry i missed to reply. In C++, the lower_bound and upper_bound functions work with pairs in a similar way as they work with other data types. These functions are typically used with sorted containers such as std::vector or std::set. When using std::pair in a sorted vector and calling lower_bound or upper_bound, the comparison is done lexicographically. This means: The first elements of the pairs are compared first. If the first elements are equal, the second elements are compared. 1. lower_bound: lower_bound(first, last, value) returns an iterator to the first element in the range [first, last) that is not less than (>=) the specified value. In case of pairs, it will find the first pair where both the first element is not less than the specified first value and the second element is not less than the specified second value (lexicographically). 2. upper_bound: upper_bound(first, last, value) returns an iterator to the first element in the range [first, last) that is greater than (>) the specified value. For pairs, it will find the first pair that is lexicographically greater than the specified value.

[@gui-codes]

@@codestorywithMIK Please make a short video on teaching more about lower_bound and upper_bound

[@higuys450]

I am not able to be consistent, I try so hard to get some time for DSA, but due to my college, i barely get time for semester subjects. What do I do ?

[@Ash-fo4qs]

like in my calendar 1 - we took ordered set - we wanted sorted order how to decide here we don't want that.

[@Mohit_Q]

please start providing the pdf of lech

[@VivekYadav-h6z]

🙏

[@ayushraj-lt4oc]

Time Complexity should be o(n*n) .

[@rajchinagundi7498]

This is how i wrote :```class MyCalendarTwo { public: vector doubleBook; vector singleBook; MyCalendarTwo() { } bool checkOverlap(int a1,int b1,int a2,int b2){ return max(a1,a2)

[@anikbiswas8]

class MyCalendarTwo { public: setinterval; setoverlap; MyCalendarTwo() { } bool book(int start, int end) { auto it=overlap.lower_bound({start,end}); if(it!=overlap.end()&&it->firstsecond>start) return false; } pairintersect={start,end}; it=interval.lower_bound({start,end}); if(it!=interval.end()&&it->firstfirst,start),min(it->second,end)}); intersect={min(it->first,intersect.first),max(it->second,intersect.second)}; interval.erase(it); } if(it!=interval.begin()){ auto p=prev(it); if(p->second>start){ overlap.insert({max(p->first,start),min(p->second,end)}); intersect={min(p->first,intersect.first),max(p->second,intersect.second)}; interval.erase(p); } } interval.insert(intersect); return true; } }; why is it not working?

[@aws_handles]

And please don’t be sorry 0:31 ❤

[@Abhi_008]

This is not a optimal approach ?

[@aizad786iqbal]

My calnedar III kal ka POTD ho sakta hai , u can cover* that in advance :D