0-1 Knapsack Problem (Dynamic Programming)

Video quality	The size	Download

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

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

Quick note: I said "memorization" in this video, but it should be "memoization" Sorry, my mistake
Comment from : CS Dojo

eisai gtp
Comment from : Δημητρης Καρβουνιαρης

Is it not a np complete problem?
Comment from : Smruti Dash

Okay but what if we tweak the problem so each node has one of 3 colors and we need to maximize the set of nodes with 1 blue 1 red and 1 green node?
Comment from : Brock Obama

using this code as inspiration to solve a really wacky problem right now
Comment from : VanessLife Tag Force Special! ♥

5:35
Comment from : I Love Dat Fruity Booty

hi, cs dojo may i request u to iterate through dynamic programming solution to see clearly how it works
Comment from : la

Not sure I understand - in the worst case, for example when weights are unique powers of two - each combination has a completely different C So that would be basically still 2^n as the cache would never hit twice Am I wrong?
Comment from : uripre

how about pca the n-item (n-dimensional) space
Comment from : Jkauppa

Thank you so much! A really helpful DP refresher for me :D
Comment from : Jin Yang

I feel in over my head lol
Comment from : Ian Hnizdo

Thank you, helped me a lot
Comment from : Luis Alejandro Rubiano

This is Divide and Conquer not dynamic programmming
Comment from : bellabas

For some reason this video didn't click for me so I went to Abdul Bari as he clearly explained the formula and approach step by step Maybe Im just a bit slower but hope this helps people who just didn't get it here :/ Don't feel bad if you didn't get it, you're not alone at least aha
Comment from : Isaac King

Is there a leetcode equivalent of this problem?
Comment from : Pooja Mehta

Is bottom up method always the efficient method? Pls provide a way to contact about our doubts
Comment from : JEE HACKS

The bottom up approach does not need to store all the n-1 previous values Only the previous two This would get the space complexity down to O(1)
Comment from : Mircea Nicolaescu

damn this was easy??? thanks so much!
Comment from : Malavika Unnikrishnan

CS Goat
Comment from : VisualDivider

Thanks Sir, god bless you
Comment from : Roushan Kumar

1:22 why the cost is O(2^n)? i thought it's 2n, since you have 2 options for n elements
Comment from : lello bidello

Thanks dude! brIt helped
Comment from : Rahul Bhatija

i cant understand anything sorrry bro
Comment from : varun sharma

Please do show solved problems in the end using both methodsbrAh! I am just 4 years late here
Comment from : Nandkumar Pawar

oh, I thought only the bottom-up solution can be counted as dynamic programming hmm
Comment from : Asahi Kitase

I used to be scared of recursion but I know realize how powerful it can be when you apply dp to it, not to mention how short the solution is
Comment from : julian campos

Why used max() function?
Comment from : Neo Jai

I cant hear well
Comment from : soroyo

I finally understand! Thank you!
Comment from : Jonathan Davies

need binary knapsack problem algorithm
Comment from : JUNAKI AKTER

highest value on lowest weight LOL
Comment from : ViniByte

Thank you, very clear and a great refresher, saved me waiting for a book that I borrowed to someone, and helped me finish me work
Comment from : Penguin Monk

I'm a bit confused as to why the it is N*C? Can someone elaborate with an example
Comment from : Carlos

volume issue
Comment from : Shashank Rustagi

Memoize 😅(you told it in 1st video)
Comment from : Disha Gupta

Best Knapsack explanation ever 💯💯
Comment from : dnavas77

At 8:44, can someone explain why the time/call is constant?? Thanks
Comment from : Tony / ToeKnee

i dont understand pls call me
Comment from : Bogdan Vukomanović

You are the best SirWish you the best in your life !!
Comment from : P G

Why the time per call is a constant time 8:50?
Comment from : David Wu

Please, add more DP videos with examples
Comment from : Sovan Mondal

Knapsack 0/1 with detailed explanation - youtube/ZYYNcm6Kn3g
Comment from : Parul Goyal

Good explanation !
Comment from : IslandRai

Best explanation EVER
Comment from : Dmitry Samoylenko

Sorry, did i miss something? How do you display maximum value and list of weights included in the result?
Comment from : Sridhar Kondoji

Great job!!
Comment from : Christian Sailor

Which software are they using ?
Comment from : Ayushi Gupta

Please make more dp lectures
Comment from : CobrAndrew G

why cannot we use greedy algorithm
Comment from : Keshav Maheshwari

So we add a dummy variable to the array to get the right element Lol what does this even mean
Comment from : Dan Yelizarov

Im not speak english, Im not understand all that u said, is it python?
Comment from : Kali Maros

Wow, thank you for making this video It is very clear! Well explained >< Ah, saved the day!
Comment from : Lovely world

Dear YK Sugi, Explanation of recursive problem solutions is a bit tricky I must commend you on the fine job you do in explaining your approach and solutions Thanks !
Comment from : rajiv r

Must watch for anyone interviewing in tech
Comment from : Beyond Meaning

you my friend you are the bestbr<3
Comment from : Mml

What program do you use to record the video?
Comment from : Dr Roger L

finally no Indian accent
Comment from : Peter

Thanks, you saved my ass
Comment from : JRYin

Very well explained!
Comment from : Suraj Chavda

Can you show how bottom up is different from top down approach? I feel Bottom approach is easier to read and to figure out time complexity
Comment from : A

Can anyone explain why the total number of total solutions at the start is 2^n?
Comment from : pjately078

I love u 3000 for explaining that naive recursive relation
Comment from : Auctal

thank you
Comment from : Sungjun Seo

Is this Jian Yang of Silicon Valley? Btw great explanation
Comment from : eikenn

Hey, what software do you use to create these videos? As in the writing part
Comment from : Amarnath Karthi

great man!!
Comment from : Anguchamy periyakaruppan

love your explanations
Comment from : Devansh Sharma

One of the best videos I have seen and learned from :) !!!
Comment from : Omar Tahboub

your audio quality is below par video is good though
Comment from : Aman Kumar

Your explanation really hit the core and was helpfulThanks
Comment from : Ramesh Veeramani

Omg, Thank you for making my life less miserable
Comment from : Skeptic Bubble

nice
Comment from : Cheng Hongyu

Why did you take a 5*10 matrix???
Comment from : QuantChallenges

Kind sucks that in this example, caching values only saves us 3 calculations out 25 ([0,1], [0,3], and [0,5]) lol
Comment from : r n

I think this is an Incomplete explanation that doesn't fully paint the picture of how the algorithm works on a deeper level, this explanation seems to encourage memorization of the pseudo-code, coming from someone who just wrote the code both recursively and iteratively without reference
Comment from : Zehahaha