0-1 knapsack problem

#1

Please tell me how to optimize this by top down dp approach …please edit my code

#2

Hey @lovish2552 are you sure your this code is correct?

#3

With test case this
5 4
1 2 3 2 2
8 4 0 5 3

Desired output is 32
Yours is giving 13

#4

Yaa this is correct…and 3 test case passing and other 2 has TLE because it is not optimized

#5

No the desired output is 13in the question also

#6


See this code.

#7

Can you forward me the link for the problem so that I can see which question is it?

#8

I want you to change my code to top down dp approach

#9

I got the problem , wait I’ll debug it soon and let you know :slight_smile:

#10

See this code https://ide.codingblocks.com/s/348849?_ga=2.202326802.206232271.1603108365-1990619524.1596102109

#11

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.