LeetCode 322 Coin Change - Why Naive Fails

Try all combinations of coins that sum to the target.

With amount $a$ and smallest coin $c$, you might use up to $a/c$ coins. The number of combinations grows exponentially.

Can you build the minimum for amount $a$ from solutions to smaller amounts?