0/1 Knapsack Problem Dynamic Programming

Video quality	The size	Download

Информация о 0/1 Knapsack Problem Dynamic Programming

Название	:	0/1 Knapsack Problem Dynamic Programming
Продолжительность	:	15.50
Дата публикации	:
Просмотров	:	1,8 jt

Thanks
Comment from : @KuldeepKumar-jc3mg

first video that made me understand the knapsack problem and the code!!! thank you!
Comment from : @biancasbookishadventures

whats this going steps back in the above row, do we have any logic for this?
Comment from : @ayushsomani6192

thank you random indian person behind my screen for teaching me how to solve this quite magic riddle
Comment from : @onboho8896

hey peter parker
Comment from : @tejasdashpute1787

this video finally ended my hunt to find a video which explains me knapsack perfectly
Comment from : @emadshoaib7846

English k chodu hindi bolne me saram aati h kya
Comment from : @Prashant_Rawat01

Nicee video man
Comment from : @hardiksonawane165

I swear I feel like these guys don't know what they are explaining brThey just try to regurgitate the solution not knowing what it means
Comment from : @r3boxx

this guy is so bad ,give me my 15 min back
Comment from : @arjunkabule5707

Very nais content
Comment from : @andreidoroftei2532

Gautam Gambhir, bhaisaab, ye kis line me aa gaye aap
Comment from : @yogeshberia

best untav
Comment from : @vishalvaitla8658

Bhai kya aap Hindi me bhi video bana sakte ho
Comment from : @techmunda7109

thanks 🎉
Comment from : @josepaulofernandes4052

I think you are making it unnecessarily complicated at 6:17 You said that we go back 3 steps back for some reason, but this isnt necessary because all you need to say is: "since our max weight at 5, we are only looking at the item 1 and 2, the max value is 5"
Comment from : @acornfedsimpleton5914

Jabran me fluency mat la
Comment from : @bhupendraprajapat4262

Hindi bol bhai
Comment from : @bhupendraprajapat4262

Explained quite well!
Comment from : @niyatikhandelwal7017

Thank you for this clear explanation!
Comment from : @Catt0

Gautam bhai tussi great hoooo 🙌
Comment from : @techeasy602

Let's get quick at everything
Comment from : @iamshishir24

Thank you so much for you videos, they are super helpful! Which textbook are you using to learn this content?
Comment from : @jaredtweed7826

Arigato
Comment from : @shubhamsukum

confused!!!
Comment from : @brucemlambo4158

This is the THIRD video I've watched on the Knapsack problem and the ONLY one that helped me understand it Thank you so much for sharing this!
Comment from : @gretacwink8659

he reminds me of an Indian Ray William Johnson
Comment from : @Syneptic

legend
Comment from : @webbly8840

you are amzing!!! i finally understand knapsack with your videos
Comment from : @huatu6859

nice explanation
Comment from : @NirajKumar-od9ex

Thanks Tushar this video was very helpful
Comment from : @opencortex

Do we need to consider a case when total items are 0 and we still have 0 or more amount of weight left?
Comment from : @mortysmith697

Superb 💥💥
Comment from : @arpitac9481

Best explanation yet, nice job my man
Comment from : @rbt-0007

Really good explanation If you had included the formula in the beginning, it would have been more easier to follow
Comment from : @sumedhaj9017

very well and fast explained! Thank you
Comment from : @CMGBgamerz

Tushar Sir🙏🙏🙏🙏🙏🙏🙏🙏brThanks a lott🙇‍♂🙇‍♂🙇‍♂🙇‍♂
Comment from : @harshpanwar1550

I highly recommend not to study dp form this guy he directly jump to tabulation
Comment from : @mkhussain3099

15:32
Comment from : @aileenrmaglalang8017

Your videos are really really good But in order to go with your pace ,one needs to have some knowledge of each problem that you discussed
Comment from : @souvikadhikary8990

Good tutorial my friend
Comment from : @olliglorioso9348

u r doing the God's job thank you :D
Comment from : @harpercfc_

How to solve if total weight is 50 ?
Comment from : @coder_us_

do we have to sort the input in increasing order of weights? will this table approach work for unsorted weights as inputs ?
Comment from : @xyzxyzspoon

Great explanation of the 01 Knapsack dynamic programming algorithm Super clear
Comment from : @krystofwoldrich

Learned a lot from this video Many thanks! 💯
Comment from : @letienat1604

सर आपके बोलने का तरीका ठीक कीजिए, समझने में बहुत दिक्कत हो रही है!!! ☹
Comment from : @Pamir026

Thank you so much! You saved me
Comment from : @monhern2

Finally someone from India who speaks English
Comment from : @kingofyoutube9318

can you explain the same problem in top down
Comment from : @koteshmeesala1630

I think first the recursion tree should be drawn and the problem should be solved in a top down approach I would suggest going over the inside code tutorials on Udemy This seems like memorizing how to fill the cells
Comment from : @adityadeore4649

respect
Comment from : @wissembettaieb2763

For your code to work (that you explained toward the end of the video), you will need the very first row of the table filled with zeros (0)
Comment from : @asayfuddin

Great explanation
Comment from : @adilhajiyev4606

thank you sir
Comment from : @daddlplays4060

Thank you!!
Comment from : @Gravityys

Thank you!
Comment from : @Woynert

Still helpul in 2021🔥
Comment from : @vaibhavsudan7384

Thanks, Tushar, this is a lifesaver, what about a knapsack with repetition
Comment from : @odumosupeter8563

Hi Tushar, your videos are very helpful Thank you for making them Today I found out that you are also my senior from college I don't remember connecting with you in college though, maybe coz we were in different branches I am from MNNIT 2007 batch P&IE stream Maybe some day we will connect in person
Comment from : @MrRud123

Am I the only one who thinks that DSA problem explanation without coding solution is just like teaching mathematics orally , i mean you understand everything but as soon as you try to solve it you cant solve anything
Comment from : @vaibhavasrivastava3957

Concise and excellent execution 👏
Comment from : @KantipurSoft

is this unbounded knapsack concept??
Comment from : @somenchowdary6300

oh no, I can't believe I understood it!
Comment from : @chenmucls

Super explanation! Thank you
Comment from : @RaghavaIndra

Best explanation I've seen Great work!
Comment from : @LLiiaamm_

So dumb🤣🤣
Comment from : @gamerhu7462

please give me answer of this question I have wasted lot of time Find the minimum no of elements from array which gives sum exactly equals to the W, ( conditions: elements cannot be repeated only print count)
Comment from : @aniketkhandave2401

This is the one and only explanation understands me the KNAPSACK My fav algorithmer Thx :-)
Comment from : @prepella3

A starting solution would be here youtube/ga5mHvWIS38
Comment from : @christofrank4862

excellent in a word thank you so much sir
Comment from : @sonercan4417

I thought dp is too hard for me now he has changed my thoughts
Comment from : @devrajgoswami4357

wow
Comment from : @CHAN-xn9eq

i still dont understand how to code it :(
Comment from : @ishaankulkarni49

god bless you
Comment from : @sonofgod00

Superb! Much better than my Algorithm teacher in Uni, thank you very much!
Comment from : @cesarteddybear997

thank you so much clear visualisation :)
Comment from : @anushkachakraborty8635

I have finals tomorrow and this video saved me!
Comment from : @shreyasvedantam2340

wtf Not gonna say why are we using DP? worst explanation destroyed the gist of the problem
Comment from : @ritikgarg1398

the only video with rqd proper explanation for this problem
Comment from : @sargamagarwal4544

Nice, thanks alot!
Comment from : @blastoice9281

thansk you verry much, i from viet nam
Comment from : @huynguyenquang1993

thotal weat
Comment from : @underdog5255

Thank you, Could you please fix your board the crackle sounds are distracting x)
Comment from : @ahmadalk2540

superb
Comment from : @algosimple7603

How do I go with big numbers? let's say my weights and values are {1543: 320, 2000: 400, 3250: 600}, I won't be filling so much memory with empty cells
Comment from : @daniezzeddine1106

This is the best explanation of 0/1 knapsack problem!!!!
Comment from : @dipanjanpramanik1916

Excellent, cleared up my misconception about picking individual higher weight items from a set of items to get closest to target value
Comment from : @MaxGuides

I spent 2 whole days trying to understand 0-1 knapsack problem until I stumbled upon this video This video explains more than just arriving on a mathematical equation Many thanks for making this video
Comment from : @TheDeepsz