0/1 Knapsack Problem Using Backtracking || Backtracking Algorithm || DAA

[@gaurav8443]

bhai thankyou somuch b'cause of u i scored well in ALC

[@vobensingh8404]

Excellent explanation 👍👍👍

[@fantasyworld9503]

Got this concept in just once wow... Thanks

[@PranabLovesEveryone]

Nice explain ❤

[@coder_aj_001]

9:35 screenshot 🙂

[@sadeghkhosravi]

Thank you👍👍❤

[@dibyamrajput09]

Thank you so much sir 😊🙏

[@premadongare4105]

on the right side, we haven't taken the x2=0 vala step why so?

[@RahulVerma1822]

Cause there is no combination left which will be so perfect to give more profit and fit under capacity

[@Mlivemovies]

if profit is being added why not weight??? at 2:07

[@aryanpandey8262]

Wrong

[@souravbhagat1358]

Sir pls upload the remaining vedio lectures on String matching algorithm.
Approxination algorithm
Parallel Algorithm .
This topic are very important but not in UA-cam in easy way.
Thank you

[@THEGATEHUB]

Will upload soon

[@shivamdalania]

Concept clear

[@sergiolo3196]

Thank you!

[@adrikamondal17]

great explanation

[@UjjawalGajjar]

Sir, Agar profit kum weight ma Jada ho aur Jada weight ma kum ho to konsa include karna chahiya

[@tejaltatiwar4682]

?

[@sycodes]

YOU HAVE TO SORT IN INCREASING P/W FIRST

[@MehtaArpit-e7l]

just mazing

[@Santoshkumar-ko1xt]

bhai code bhi de diya hota

[@anandmali4059]

this is wrong method for 0/1 knao because it is sum of subset using backtracking hai

[@tejaltatiwar4682]

Then which is correct

[@U2_yT17]

worst explanation