Return the fewest coins needed to make `amount`, or `-1` if impossible. Variant **#34**.
Example 1
Input: coins = [1,2,5], amount = 9
Output: 3
Constraints
Acceptance: 48% · Topics: dynamic-programming, bfs
← All practice problems