CSES Dynamic Programming (Knapsack Problems)

Q1. https://cses.fi/problemset/task/1633/

Variant of Coin Change Problem
“For each i as target, count all possible ways using given coins”
dp[i] = All possible ways to get i using all coins