Table of Contents: Introduction 0:00 - 1:22 Greedy Algorithm Walkthrough 1:22 - 5:14 What We Want To Prove 5:14 - 7:03 Exchange Arguments 7:03 - 7:33 The Proof 7:33 - 11:30 Trying To Exchange 11:30 - 16:20 Finishing The Argument 16:20 - 19:24 Conclusion 19:24 - 20:17

This is an award-winning explanation if one considers the patience, thoughtfulness and elocution with which it has been done. God bless your continued efforts in education!

I have never seen so in-depth understanding of Interval Scheduling ANYWHERE! Keep killing it!!! THANKS, A LOT! "By the very nature we are doing something, there can be no conflict" hit me the most.

This channel is a goldmine Just really exceptional stuff clear, concise and fun to watch

Your channel and leetcode got me an internship at facebook. Thank you dude, keep it up!

I just fell in love with this explanation !!!

This man has helped me with my algo class more than anyone else

Can you believe that I have attended two 2 hour lectures about greedy algorithm and I have just understood it in this 20 minutes video! Thank you!

dude, your explanations are out of this world! you’re helping me with interview prep so much. thank you & subbed, liked. this channel is en route to blowing up!

I have an Algorithms Midterm tomorrow and I found this video to be super helpful! I could understand everything you were saying! Simple and straightforward explanations are the best!!! Thank you for this!

Best problem-solving channel on KZfaq. Brilliant stuff!

binge-watching your videos before a final round interview. thank you very much! your videos have helped me get so much further this recruiting season.

Just wanted to let you know you are God's gift to mankind. I can really tell you have a genuine passion to teach and help others. Not some scumbag (which there are many, unfortunately in this industry) looking to cash in on exploit tech job seekers because the market is fiercely competitive these days. And even if you did end up charging for your course, I'd still pay for it because you come from a good place. Great work.

You're such a talented teacher, than you for these wonderful videos!

been watching all your videos for my final and man you explain 16 weeks of school better in a 20 min video.

These videos of him are amazing! He explains perfectly well and understandable. Thanks for that!

Excellent! As a person with a background in math who now works as a software dev who’s looking for a new job, this was great. Underneath it all, at its fundamental level, i think this a proof by induction. Very well explained!

dude, you are born to be a teacher!

Duuuude! The best explanation I've found on Exchange Argument! God bless you!

Very hard to build an intuition for this, but this video is closest I have seen.

such a great and clear explain, even though I am poor at English can understand.

Jesus Christ what an incredibly fresh cut

Love this. Wish it would show a written proof with induction. Only saying this because there was a lot of talking, but putting this into a written proof is a bit mind bending. However, absolutely thumbs up and subscribed!

This makes good sense. I had to picture in my head the diagram or examples as you explained all the WHY's, to convince myself that it's always true. And indeed it is. It's hard to think about application of this to other algorithms though.

I dont understand, so everything is the same from G to O until k-1 but k is where everything diverge ? how can you say that the finishing time fo G(k)

You are an algorithmist. Such an inspiration!

I wish you were my professor. This is sooo helpful

Amazing video! Thanks for the wonderful content always!

Your explanations are the best!!!

I really should have watch this video before my midterm

Very clear explanation!

Consider a variant of this question. We are supposed to find intervals giving the max cardinality as before. But the added constraint is that in the case of two solutions having the same cardinality, we need to pick the solution where the length of time covered by all the intervals is lowest. What modifications (if any) to the current algo would be required?

MAN was this video well made, thank you.

Incredible video! Thank you!

i had a similar problem, but i cant find a solution to this anywhere. in fact, i cant even find the problem anywhere (i originally saw this problem on my university test). the problem is, u r given n jobs with start and finish times, and u have to find the minimum number of processors that can finish all jobs. a processor can only do disjoint jobs (jobs that don't overlap). Sample test case: There are 5 jobs (with start and end time given respectively): 1 11 2 3 3 6 4 6 10 13 The answer is you need a min of 3 processors to complete all the jobs. processor 1: 1-11 processor 2: 2-3 4-6 10-13 processor 3: 3-6

Crystal clear!!!! Thank you!

Thanks, this is best explanation of the proof

Great job explaining!

This helps me a lot. Thank you

Very good explanation, thank you!

watching this tonight coz i have finals tomorrow.thanks for such a great explanation. Have u done interval partitioning as well?

you save my life

Good job. Well explained

Hey John Legend! Keep up the Good work my man!!

Great explanation!

شكرا صاح! عمال ساعة بحاول افهم بس انت راجل صح الصح وفهمت خلاص الحمد لله.

Thank you so much.

Nice explanation :)

Thank you so much for the video!

Thank you so much!!!

great work

Nice video, could you do a video on Weighted Interval Scheduling?

Thanks for these amazing videos . could you also add the question link, so that we can try

how you can say that fgk

thank you sir

You got a subscriber

aaammaazzinggg...got it perfectly

great explanation thank you :)

thanks i get it now bro

I understood the first part (the algorithm explanation) but not the one where you compare the Optimal vs the Greedy one. I guess I need to see it more times. Haha. Anyways, awesome work!

He spoke of the code in the description, but I cannot find it

Why sort by finish time and not by start time? I sorted by start time and it cost me a coding round :(

Well I was not cleared how you made sure your greedy solution is the optimal solution. Is it possible to share more information?

so this looks like a combo of greedy and dynamic programming right???

Subscribed.

I am a little confused. Does an exchange mean that ur are sawing 2 events? Or are u inserting one and still keeping the other? For ex, gk and bk, did u put gk in optimal set and still keep bk after it or did u replace bk by gk?

Is there also a greedy method for maximization of the intervals length instead of the amount of intervals?

cool and nice

can we say Greedy Exchange is the most efficient solution?

I need to rob my University, take all what I've paid them, and hand it all to you

Hero !

so good

too late :'(

you save me thanks

I think I kinda got what optimal substructure means here ..

where the heck is the code? 🤔

godlike!!

What is your leetcode username?

bro the implementation ? the code?

waiting for your video

sup bro?

Great explanation but why does he explain this like a tech bro hahaha

unclear!!!!!!!!!!!!!!!!!

Good explanation :|

very much thanks sir