Medium · Dynamic Programming

Coin Change

Given an array coins of positive denominations, each usable any number of times, and an integer amount, return the fewest coins that add up to exactly amount, or −1 if no combination does (amount 0 needs 0 coins).

{
  "coins": [1, 3, 4],
  "amount": 6
}

{
  "coins": [2],
  "amount": 3
}