4.5.1 0/1 Knapsack Problem (Program) - Dynamic Programming

Video quality	The size	Download

Информация о 4.5.1 0/1 Knapsack Problem (Program) - Dynamic Programming

Название	:	4.5.1 0/1 Knapsack Problem (Program) - Dynamic Programming
Продолжительность	:	17.00
Дата публикации	:
Просмотров	:	411 rb

Taught very clearly!br(Perhaps a little mistake at 15:26 ? Reducing i-- before accessing J for weight reduction would seems wrong ?)brThanks for this brilliant teaching sir
Comment from : John C

Thank you sir
Comment from : Daipayan Hore

Best explanation,ever!!!
Comment from : Abhiresh Ray

Ma sha Allah sir May Allah bless you!
Comment from : Mohiuddin Rahman

I can't belive how talented you are
Comment from : VanjeAv

Sir last m cout <
Comment from : Learn more and more

Gurudev 🗿👑
Comment from : Aryan Dwivedi

Thank you very much You are a genius 👍👍👌👌🔝🔝🙏🙏
Comment from : VAKHARIYA JAY

You are an amazing teacher
Comment from : Kayode Olakunle Oluwaseyi

its wt[ i-1 ] not wt [i ] becausearray indexing at 0 onwards
Comment from : Yaswanth Kosuru

sir , can u please upload code link
Comment from : dharani rama

Sr, I have no words for appreciation of your way of teaching I can't compare it with that of any other course faculties or youtubers Its Unique ! I am following your course also for dsa from Udemy, i have successfully completed it and it happened first time with me that I am almost 90-95 satisfied with a purchased course and that is also at easily affordable cost Thankyou So Much for your efforts for us, Sr I want to pay Respect to you by heart !🙏
Comment from : 051-AVNEE

Thank you for your efforts
Comment from : Mohammed Adel

I guess the order of both the solutions is O(n^2) The good news is that we came down from O(2^n) by discarding unnecessary combinations,
Comment from : Anand b

This code is stuck in my mind from the way you explained thanks for taking so much efforts for us God bless uhh 🙏
Comment from : Stutis Flairs

Not understanding the part k[3][6]
Comment from : hema gohain

god bless
Comment from : wow!

I have now understood the meaning of the universe, the key to everything but I cannot explain it (or give it) to you You have to find it by yourself
Comment from : Mr Kyle Descoudres

No words to describe how excellent your teaching is
Comment from : Suraj Suryawanshi

My Dog watched this video and now some objects and one Bag is missing from our home along with the Dog
Comment from : Nishant Banjade

TIME COMPLEXITY ?? Sir
Comment from : Sai B

Awesome content, by far the most understandable and easy to understand I aspire to be you when explaining a difficult topic
Comment from : Flex

Sir aaj 8 baje quiz hai please help
Comment from : bhavya khandelwal

nice vid, poor audio make it better
Comment from : n/a

Thanks Sir! Your explanations never disappoint
Comment from : Allan Onyango

You 're really Great Sir
Comment from : Devendra Dahale

I can feel it's a very good explanation, but unfortunately I can't understand your accent :'( It'd great if there were lyrics
Comment from : Emanoel Lucas

is it a top-down approach because of the filling the table or traversing the table from last element?
Comment from : Neo Jai

very nice explanation sir, Thank you ! :)
Comment from : CodingException

I hope this AMAZING channel reachs millions of subscribers, THANKS, sirm you are awesome 🥊
Comment from : aaron aaron aaron

Sir please make video on solving this problem by set method also🙏
Comment from : Akhil Gupta

THANK YOU SO SIRWELL EXPLAINED
Comment from : 4007 Ahamed Kabeer

The explanation is Awesome Need to know what if the weight is 100 ,223 ,345,4198 & profit is 100,200,350,1000 How to handle that? any condition is missing?
Comment from : sivashankar ravishankar

sir plz explain an algorithm for sets method
Comment from : Gowtham Reddy

his voice is similar to anil kumble
Comment from : BlazingSpirit

fantastic Respect from Azerbaijan
Comment from : Parvin Etibarli

Godfather of DS & Algo
Comment from : Kaushik Saha

Thank you man
Comment from : ghassan abokhaled

What if one element can be put twice inside a knapsack
Comment from : Baswaraj

<3
Comment from : Diego Ewin

Is it necessary here that profit and weights have to be increasing order ?
Comment from : Raj Ghamsani

I believe that’s a debugging process and not an explanation As a summary, what’s the core idea behind all these manipulations? Who knows But code’s important! And here’s the code! Brilliant
Comment from : Dan Yelizarov

thanks, you are good teacher
Comment from : Temur Mannonov

Correction :brcout<
Comment from : Rahul Chawla

Best speed (optimal) - 175x
Comment from : Rishabh Vanwani

best explanation thanks
Comment from : Priti Hinduja

how did the formula came??
Comment from : Madhukesh Kumar

thank you sir
Comment from : Gunship Battle

sir please do videos on approximation and randomization algorithms
Comment from : Vibhav Chirravuri

@500 why we are comparing index value with weights
Comment from : kamalnath L P

thank you so much sir
Comment from : Ark Pandey

Excellent explanation Thanks very much One question - the "cout << k[n][w]" should be "cout << k[n][m]" correct? Minor detail, but for no other reason than you don't have access to the variable w - it's local to the for loop
Comment from : Patty Harris