For each amount from to target, compute the minimum coins needed. To make amount i, try each coin. If coin value is c and c <= i, then one option is + minCoins(i - c). Take the minimum across all coins. dp[i] = min(dp[i - coin] + ) for all valid coins Base case: dp[] = (zero coins needed for amount zero).
##### ###### ##### ### # # ### # # ###### ## ## ## ## ## ## ## # # # # # ## ##### #### ##### # # # # # # # #### ## # ## ## ## ## # # # # # ## ## # ###### ## ### # ### # ######
$ curl repovive.com/roadmaps/maang-interview-prep/dynamic-programming/coin-change-hint
░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░██████████████████████████████████████████████████████████████████████████████████████