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