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