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