0-N knapsack-------------unable to pass all the test cases

#1
#2

@guptarahul3100 while filling dp,fill it from small to large bag like this:
for(int j = sz[i] ; j<=s;j++). update your inner loop as this it will work fine.

#3

I hope I’ve cleared your doubt. I ask you to please rate your experience here
Your feedback is very important. It helps us improve our platform and hence provide you
the learning experience you deserve.

On the off chance, you still have some questions or not find the answers satisfactory, you may reopen
the doubt.