Tag: example of knapsack problem using dynamic programming