Knapsack still is a NP-Hard Problem. Even though DP solution looks linear, it ha...

		mesarvagya on March 15, 2019 \| parent \| context \| favorite \| on: Dynamic Programming for Technical Interviews 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... [2] https://stackoverflow.com/questions/4538581/why-is-the-knaps...