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