Interval Scheduling Maximization (Proof w/ Exchange Argument)
Вставка
- Опубліковано 12 вер 2024
- Code & Problem Statement @ backtobackswe....
Free 5-Day Mini-Course: backtobackswe.com
Try Our Full Platform: backtobackswe....
📹 Intuitive Video Explanations
🏃 Run Code As You Learn
💾 Save Progress
❓New Unseen Questions
🔎 Get All Solutions
Subscribe To Live Tech Offers: offerfeed.io
Join Our Coaching Service: backtobackswe....
In this video, we talk about the Interval Scheduling Maximization Problem. We look at the greedy solution as well as a proof via an exchange argument.
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
great video man
thanks
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.
ye - lol nice
This channel is a goldmine Just really exceptional stuff clear, concise and fun to watch
thx
Your channel and leetcode got me an internship at facebook. Thank you dude, keep it up!
Excellent, have fun there!
fr? how did you apply? can you help me out?
congrats
congrats!
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!
haha thanks, and nah, it is steady growth so slowly but surely
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!
This man has helped me with my algo class more than anyone else
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!
Nice
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.
great
I just fell in love with this explanation !!!
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.
Haha, um, I mean I am morally dubious certain days, mostly not. And yeah lol, I don't really think about anything I'm doing...I'm just doing
These videos of him are amazing! He explains perfectly well and understandable. Thanks for that!
thanks
Best problem-solving channel on UA-cam. Brilliant stuff!
You're such a talented teacher, than you for these wonderful videos!
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!
been watching all your videos for my final and man you explain 16 weeks of school better in a 20 min video.
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.
ye
Duuuude! The best explanation I've found on Exchange Argument!
God bless you!
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!
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)
Amazing video! Thanks for the wonderful content always!
sure
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.
Happy Halloween 🎃 Thank you for your kind words, shizibaozi! What languages do you speak? You get some extraaa treats for the hardwork - 50% Off our exclusive lifetime membership use the code SPOOKY50 - backtobackswe.com/checkout?plan=lifetime-legacy&discount_code=SPOOKY50
dude, you are born to be a teacher!
You are an algorithmist. Such an inspiration!
Lol, no, I'm just an average dude who recorded a lot of videos
Your explanations are the best!!!
sure
Jesus Christ what an incredibly fresh cut
Very clear explanation!
Happy Halloween 🎃 Thank you for your kind words, EliseGreen! Let us know other topics we could cover! We'd love to offer you 50% Off our exclusive lifetime membership use the code SPOOKY50 - backtobackswe.com/checkout?plan=lifetime-legacy&discount_code=SPOOKY50
Incredible video! Thank you!
Happy Holidays 🎉 Thank you for your kind words, ahonhuman! We'd love to offer you a 40% Off our exclusive lifetime membership just use the code CHEER40 - backtobackswe.com/checkout?plan=lifetime-legacy&discount_code=CHEER40
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
I wish you were my professor. This is sooo helpful
sure
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?
im not sure I barley remember this video im sorry
@@BackToBackSWE Oh, no issues.
watching this tonight coz i have finals tomorrow.thanks for such a great explanation. Have u done interval partitioning as well?
na
MAN was this video well made, thank you.
Glad you enjoyed it!
Crystal clear!!!! Thank you!
nice
I really should have watch this video before my midterm
hey
Thanks, this is best explanation of the proof
sure
This helps me a lot. Thank you
great
Hey John Legend! Keep up the Good work my man!!
ok
@@BackToBackSWE "ok", *seriously?!
Good job. Well explained
thanks
Thank you so much.
Great job explaining!
Thank you so much!!!
sure - thanks for watching
Very good explanation, thank you!
Great explanation!
thx
Nice explanation :)
Thank you so much for the video!
sure
aaammaazzinggg...got it perfectly
you save my life
great work
شكرا صاح!
عمال ساعة بحاول افهم بس انت راجل صح الصح وفهمت خلاص الحمد لله.
cool and nice
thanks lol
great explanation thank you :)
Nice video, could you do a video on Weighted Interval Scheduling?
Yes, I just don't have the time though. If you have . aquestion I can answer it here
No question! Your explanation is really good btw! I was just having a hard time understanding weighted interval scheduling and hope you can do the video on this when you are free :)
@@squadbustersgamings ye
thank you sir
You got a subscriber
I'm blessed
thanks i get it now bro
nice
Thanks for these amazing videos . could you also add the question link, so that we can try
I don't have a link for it
Subscribed.
Well I was not cleared how you made sure your greedy solution is the optimal solution. Is it possible to share more information?
I forgot the contents of this video but loosely remember that it had to do with an exchange argument. Fast replying to comments cant address
He spoke of the code in the description, but I cannot find it
The repository is deprecated - we only maintain backtobackswe.com.
I need to rob my University, take all what I've paid them, and hand it all to you
Hahaa
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?
Hero !
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!
The notation & abstract academic nature of proofs confuse at first. Most take a bit to sink in.
very much thanks sir
so this looks like a combo of greedy and dynamic programming right???
Is there also a greedy method for maximization of the intervals length instead of the amount of intervals?
not sure
I guess in this case you need to exchange previously chosen interval with current if it is smaller then current and continue
how you can say that fgk
so good
Why sort by finish time and not by start time? I sorted by start time and it cost me a coding round :(
can we say Greedy Exchange is the most efficient solution?
I'm not sure? Efficient asymptotically or in terms of real elapsed time? If the former it'd have to be, because linear time is the lower bound, we have to inspect all intervals.
you save me thanks
too late :'(
haha, indeed
godlike!!
Thank you, glad you liked it 😀
Do check out backtobackswe.com/platform/content
and please recommend us to your family and friends 😀
where the heck is the code? 🤔
repository is deprecated, we do not maintain it but it is still on my github
What is your leetcode username?
leetcode.com/bephrem/
I think I kinda got what optimal substructure means here ..
nice
bro the implementation ?
the code?
The repository is deprecated - we only maintain backtobackswe.com now.
waiting for your video
wassup
Burst balloons dp problem please post
@@arunm619 yessir
sup bro?
hi
Great explanation but why does he explain this like a tech bro hahaha
Good explanation :|
thx
unclear!!!!!!!!!!!!!!!!!
ok!