@TheMightyBean321

Watching a few of your videos and in this one it seems like you are talking as if to not wake up someone sleeping next to you. You can still hear everything clearly, but I just thought it was kinda funny. Thanks for the video :)

@kausikhm

Thanks to this I passed my exam!!!

@shubhamjain54519

I am getting time limit exceeded with this approach

@skewbinge6157

these videos are good but you should consider raising the voice either nt the mic options or when editing the video

@utkarshankit

so what is the difference remains between job sequencing problem and activity selection problem??

@snehah1629

Thanks a lot. I have a doubt can we allot job A in the time slot from 0-1 ?

@vatsalmankodi9050

Thank You for such videos. Hoping for many such helpful tutorials form GeeksForGeeks.

@angshukNag

Will Greedy method work for this (profit, deadline) tuple set ? .... { (5, 1) ,  (33, 4), (35, 4), (37, 4) }?

@sayantangupta1403

You People are doing an excellent job. Keep it up. If you need any help, just let me know dear.

@tswfootball

This is good, but you should explain how you can be sure this is the optimal solution.

@aditigupta6870

Time complexity should be O(nlogn+n*T) right and SC should be O(T) and not O(n) but its written in article O(n)?

@PotatoFamines

Thanks a ton

@jdragon8184

its very cringy for me cuz i just completed dynamic p , but i thought why do a job if it can be delayed

@mahabirsaha5777

Greatly explained !!!

@vamsikumar93477

Thanku for nice explanation

@Programming-mind

Nice explanation 👍
Thnx

@santoshr4212

Volume is too too low.

@sarthakkumar856

Really great explanation :D

@TheIshaan94

I love your videos but the volume is so low.

@satadhi

this is 2017, why cant you guys make videos in 720p ? btw these videos are awesome! to the point and human friendly