0/1 KNAPSACK PROBLEM Dynamic programming

Video quality	The size	Download

Информация о 0/1 KNAPSACK PROBLEM Dynamic programming

Название	:	0/1 KNAPSACK PROBLEM Dynamic programming
Продолжительность	:	37.33
Дата публикации	:
Просмотров	:	87 rb

Dynamic programming is the most difficult topic for me, but this explanation was so clear thank you very much
Comment from : @alexeykorovko6704

Thank you for such a thorough explanation
Comment from : @jinhuang7258

You are the best Thank you for your detailed lecture I really enjoyed it
Comment from : @abubakursait4193

Best Explanation so far in youtube :-)
Comment from : @aravindankarthick2066

you're the best teacher Your channel deserves more views!
Comment from : @camuflagehugo5137

good exaplaination, can you pls put it in algorithm code
Comment from : @anandnerurkar8482

Sir can you plz post n queen and other algos as well
Comment from : @anamikasrivastava3994

Nice explanationbrVery underrated channelbrThank you sir
Comment from : @aman_varshney

Sir you are such a gem💯💯😃brThank you so much👍
Comment from : @shubhamsandanshiv515

Hello sir, brYou have made DP so easy to understand Would request you to make more videos on the same with diff questions on dynamic programming
Comment from : @ayushigupta1783

legend or what
Comment from : @pranjalpimpale8465

sir plz share the solution link of the code
Comment from : @ranavij

what if the capacity is something like 34 how can we solve that question with this methodwe can't make 34 cells
Comment from : @pujabhatia8046

GOD BLESS U MAN!! 2nd save in a day!!!!
Comment from : @abdulrahmanali599

Thank you teacher!! ^_^ eventhough you are 20 years younger than me
Comment from : @RizaHariati

Best uptill now thank you sirji
Comment from : @avikbose3849

Can anyone provide the full code to run it on computer
Comment from : @romitdey2213

beautiful
Comment from : @tytusgierycz5563

U'r explanation is nice sir
Comment from : @saisusmitha4066

sir last mein 3-4 second thoda board se side ho jaaya kare ki hum likh sake
Comment from : @shrad6611

love from bangladesh <3
Comment from : @AbhiKhan1010

Great explanation !! Thank you so much for uploading such content
Comment from : @hiteshsardana1

very descriptive & detailed, kudos to you
Comment from : @shubhamsingh-xk4nf

you showed "what" and "how", but not "why" which is why students forget what they learned
Comment from : @vyshnavramesh9305

Very very impressive sir ! 👌👌👌
Comment from : @VikasKumar-rb1rm

Hello sir, want some basics about DP, on how to approach and think for applying DP will be great if you could put some videos :)
Comment from : @sugyansahu9120

The most underrated channel of a brilliant person
Comment from : @saksham5841

Hello, we would really appreciate a video on segmented least squares Thank you for your videos and time
Comment from : @98krunal

Very simple way of understanding the problem
Comment from : @sabisyed

perfect
Comment from : @lasyagajavelli594

Please release a full 5 hour version with more details and slower speech
Comment from : @lpatrasco

why go on above cell for sow - w step???
Comment from : @vikasvishwakarma5263

Good Board Work Needs to reduce unnecessary repetitions
Comment from : @solidstatedevices

thanks man
Comment from : @jonty3551

Hey Vivek, very nice lecture, can you please suggest a good book to learn and solve datastructure and algorithm problems
Comment from : @prasanjitmishra3479

You are amazing
Comment from : @anuragsmusic

Thank you sir
Comment from : @pc0riginal870

Sorting of given data according to their weight is required or optional ?brCan we do it without sorting the elements ?
Comment from : @rajatbais6388

After searching a lot I get your video and it is amazing!!!
Comment from : @anuragsmusic

Awsome
Comment from : @Avery12556

awesome sir, subscribed! This is the best I could find, waiting for some more algorithms
Comment from : @mukulpanchakarla8944

Nice Explanation!brWe can also apply same algorithm without sorting the items by weight
Comment from : @tanayshah275

At 10:50 what if weight if a is 2
Comment from : @RaviKumar5

Hits off sir g Superfluous way of explaining each and every thingsbrMay Allah bless you
Comment from : @horiamalik9550

best
Comment from : @antarsarkar1058

would have made more sense had there been reference to code to see how code flow co relates to the explanation
Comment from : @kumarvivek02

Woow Such a nice explanation thanks
Comment from : @MrMalapatiravi

On this subject, I found it is better presentation than others Khyade, thank for your efforts
Comment from : @omar7amdi

it is very usefuli want travelling salesman problem solution in (logn)efficiency
Comment from : @rmohanraj2771

your lecture is batter than my uni teacher
Comment from : @humirazahoor8629

thank you for the video, sir! brI think you have to write a book too excellent explanation, thank you!!!
Comment from : @sholihatulrichas9414

came from another video comment section it was worth it may be little time consuming but totally worth it
Comment from : @babbintandukar9959

that was simple and usefulthank you
Comment from : @fatimakr5036

according to your formula the ans is wrong?
Comment from : @foodrecipes8648

do we really need to sort?
Comment from : @abhishekkarn8918

wouldn't cell [5][5] be 14?
Comment from : @joshuaglepko6884

You are saviour!Thank you very much !!!
Comment from : @JohnDoe-vv5rp

Are sir wo bhelu nh value hota h had h yr
Comment from : @viratdixit9237

Sir thankyou so much You have put a lot of efforts in the video
Comment from : @mohitsaraswat8504

Finally found a simple explanation! Fantastic!
Comment from : @nikhilsjukebox7276

you are awesome bro Are you a teacher?
Comment from : @AkshayKumar-ni8iw

Completely useful video
Comment from : @harithasri8372

your explanation was so good nd tq soo much sir
Comment from : @sowjanya7351

Thanks a lot to explain this problem,i like it
Comment from : @Gio-nk9pf

very interesting and simple lecturethank so much Sir
Comment from : @skasif4476

thank you very much
Comment from : @nguyenminhtam2302

Thanku sir
Comment from : @ashishanand4430

Very very excellent , simple and DETAILED explanationThanks for making such effort!
Comment from : @hamzashamshad4689

superb sirvery nice explaination
Comment from : @sangamtomer

Sir how to do if there are items with same weight?
Comment from : @kvktrends

it will so powerful if you can explain how to approach this table of optimal value Anyway, this is a helpful explanation
Comment from : @luongtran5055

Great Job, helping a lot of students
Comment from : @dheemanthmallikarjun514

sir please make videos on travelling salesman problem using dynamic programming
Comment from : @Pritamdas-bg7fp

The repetitive steps really helps you comprehend Nicely done!
Comment from : @taoranyan4622

Awesome explained! Keep it up!
Comment from : @ishankulkarni7886

Fantastic explanation Simple and comprehensible Thank you Vivekanand for the video
Comment from : @truptigore2838

Thanks, I finally understood it
Comment from : @takshpratapsingh6462

Implementation of this problem: googl/5iEux8
Comment from : @jain007neeraj

Thanks it was such a good approach to explain quite a lengthy problem Subscribed to your channel
Comment from : @christophertoppo

Very good video!! Thanks!
Comment from : @gmweb3622

thank you sooo much I understand it perfectly
Comment from : @nadaworld90

gaavthi marathi vhhhalue 😂😂
Comment from : @RajVerma-mc2pj

wonderful and smart lecture you did to understand knapsack concept, thank you
Comment from : @desalegnbelay9088

yeah now i'm understand the knapsack
Comment from : @abhisheksaxena1085

Good explanation and easy to understand thank you
Comment from : @mayankdagar7

Sir your videos so good I need travelling salesman problem using dynamic programming related video Thanks
Comment from : @kirankaur4009

It was really a nice explination And I loved it brI do want such an ecplination for branch and bound, greedy, and backtracking algorithms
Comment from : @edemohan9649