Loading your interview setup

Skip to content

Overview Resume Score

Practice

The Daily LarpCode Reps LarpTalk

Interview

Templates Sessions

recent

Loading

medium· 1d-dp Mock interview

Coin Change

Given coin denominations `coins` (unlimited supply of each) and an `amount`, return the fewest coins needed to make up that amount, or -1 if it is impossible.

Examples

in: coins = [1,2,5], amount = 11

out: 3

5 + 5 + 1

in: coins = [2], amount = 3

out: -1

cannot make 3

Constraints

1 <= len(coins) <= 12
1 <= coins[i] <= 1000
0 <= amount <= 5000

Hints

target: O(amount * coins) time⌘↩ run · ⇧⌘↩ submit