0/1 Knapsack Problem using dynamic programming complete | Recursive solution with memoization

[@vivekjaiswal4391]

Concept jab tak smjh nhi aa rha tha tab tak bohoot hard laga lekin jab smjh aya tab sab easy ho gya......ap sahi me bohoot padate ho😊

[@amanpandey4550]

Good to see u brother!!

[@taneyasoni]

but obvious you are one of the bests.

[@easylearning6647]

prince bhai jo aap recursive solution likhte ho top down to vhi hota hai kyonki is me hm main problem ko ek sath solve karne ki try karte hai fir sub problems me break krte hai . Iterative wale ko bottom up kehte hai konki is me starting hi sub problems se krte hai, pr apne 7:04 pr video me ulta bol diya hai.

[@harshavardhannadipilli3348]

Are the arrays sorted before starting the algo??

[@dynomohacker3476]

4 saal phele aditya verma bhai ne same btaya hai bhai agr aap bhe unki video dekh kai pdha rhe ho to kam se kam value to change krdete, value bhe same rakhi hai

[@sdmovies5430]

Nice bhiaya...plz nxt video jaldi se lao

[@HelloWorldbyprince]

sure

[@sdmovies5430]

@@HelloWorldbyprince thanka

[@siddheshb.kukade4685]

thank you sir

[@HelloWorldbyprince]

Thanks yaar ❤️ please share my channel

[@rajukumar-sv3vj]

bhai app kis company me kam karte ho

[@himanshusahu6879]

nice

[@HelloWorldbyprince]

Thanks

[@khantmadhav4823]

Itni kam number of problem ki kyu playlist bnayi apne minimum 100 ki to bnao bahut acha he ye

[@HelloWorldbyprince]

haan yaar sure i will make more playlist on this

[@mdmd3574]

​@@HelloWorldbyprince And sir jldi bnayiye aj to mene khatam krdi ye playlist😅

[@prashantgirase7553]

❤❤❤

[@HelloWorldbyprince]

❤️

[@crazyworld5124]

bhai yeh chiz samjhao dp[n][w]!=-1

[@HelloWorldbyprince]

kya samjh me nhi aaya ?