Knapsack problem dynamic programming approach missing

[kbadal19]

What would you like to share?

The knapsack problem using the dynamic programming approach is not solved. Instead, only naive recursive methodology and greedy methods are used. I would like to implement the Dynamic Programming approach which is faster and more efficient.

Additional information

No response

[Jiang15]

Hi, I have implemented with dp and the PR is here: #9295

[tianyizheng02]

The knapsack problem using the dynamic programming approach is not solved.

... Did you check the dynamic_programming/ directory? dynamic_programming/knapsack.py