Medium · Dynamic Programming

Coin Change II

Given an integer amount and an array coins of distinct positive denominations, each usable any number of times, return the number of distinct combinations of coins (order ignored) that add up to exactly amount; amount 0 has exactly one combination, the empty one.

{
  "coins": [1, 2, 5],
  "amount": 5
}

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