Lecture -10 Greedy Algorithms -I
Top Comments
All Comments (22)
-
If we consider the K copies to be single entity (since we can pick only one among them and there is nothing that distinguishes them w.r.t to problem) and then apply the minimum number of overlap technique , it will still work . Is there any other example to show minimum
overlap doesnt work?
-
haters gonna hate
-
@Pingu123489 stfu
-
Pick intervals with less overlap!!! me screaming that at 34:00 nice lecture
-
Stop making vids, go eat!
-
@SideofClouds I hope it also makes you sad when seeing corpulent parents with corpulent kids visiting Fast Food Restaurants. Of course they enjoy living ;)
-
one of the best courses during my stint. This is one video to bookmark :)
-
lecturer seems not be well prepared..he sucks in the way of explanation..Need to have some good english communication skills.Indians always suck in explanation..
-
Does he live near Fukishima
-
@SideofClouds That is coz he is greedy 4r analysis and design of algo.
It makes me sad seeing him so thin :(
SideofClouds 1 year ago 10
Man these lecture series ROCK! Best explanation for the intuition behind things!
markdixit 1 year ago 6