Weighted Interval Scheduling Algorithm Explained

[@weibinyu]

wow... I paid several thousand dollars of tuition for a professor that can't convey this simple algorithm in 2 lectures. But here you explained this algorithm in under 12 minutes for free. There is something really wrong with the education system...

[@manojjranjan4771]

Thank you very much for taking the time and energy to make this video, I found it very helpful!

[@carrymeorgg8512]

You have no idea how many people you have/will have educated (here at 6k), great visual examples and explanation

[@Nima-Salami]

Thank you for a very clear explanation and providing a detailed example! God bless you!

[@MrACrazyHobo]

Best video on the topic

[@alifuat8910]

thank you it is a very simple and clear explaination.

[@eradawnz]

Thank you, very easy to understand

[@toekneema]

great visuals, thank you!

[@udoysaha3086]

Thanks for the explanation

[@literalspam6894]

you got a new subscriber :)

[@ajayraj8055]

loved it man

[@sparrowhank]

Great video, thanks!

[@ArunaSrivastava-xb5eq]

10000/10 video

[@НиколайДомашенко-э4ш]

Thanks a lot! Very good explanation.

[@rithviknandhyala3142]

THANK YOUUUUUUU

[@yiman1196]

Great video!

[@anonanon-xg5de]

thank you man! you saved my life :o

[@n.e.seeker3619]

Thanks a lot!

[@FalseZer0]

great explanation!!!

[@eleannatheodosiou2522]

so precious!

[@Dannyblac]

Thanks a lot

[@irwangunardi275]

thank you so much, u saved me

[@kenypoudel9899]

Thank you so much !!

[@MrJahirmontes]

why is binary "clever use of binary search" O(nlogn)? Isn't it O(logn)?

[@musone8951]

You have to find P(j) for every 1

[@giannis5344]

Isn't there a way to make it O(n) with dynamic programming?

[@supreethmudduchetty2534]

What is the final answer? What are the optimal time intervals to choose?

[@chandrasaha170]

The one with least time

[@reeshavkhan4766]

Shouldn’t the total time be O(n)

[@carrymeorgg8512]

O(nlog(n)) cause its larger than O(n)

[@185rahul]

@@carrymeorgg8512 I was confused too, thank you!