Coin Change II LC 518: DP Count Ways (Unbounded)Medium DP/unbounded knapsack: dp[x]+=dp[x-c] counts coin change ways (no permutations). O(n·amount) time, O(amount) space. Practice now.