Knapsack still is a NP-Hard Problem. Even though DP solution looks linear, it has pseudo-polynomial time complexity[1][2] [1]https://en.wikipedia.org/wiki/Knap

Knapsack still is a NP-Hard Problem. Even though DP solution looks linear, it has pseudo-polynomial time complexity[1][2] [1]https://en.wikipedia.org/wiki/Knapsack_problem#Computational_complexity https://en.wikipedia.org/wiki/Knapsack_problem#Computational... [2] https://stackoverflow.com/questions/4538581/why-is-the-knapsack-problem-pseudo-polynomial https://stackoverflow.com/questions/4538581/why-is-the-knaps...