Knapsack DP Introduction - Dynamic Programming / Knapsack

Problems
1

Teaching Assistant is thinking...

This is a companion discussion topic for the original entry at https://algo.monster/problems/dp_knapsack_intro
2

For unbounded knapsack example, isn’t dp[2][3] supposed to be 3? We can use coins 1 and 2, the capacity is 3, 1+2=3??