322. Coin Change

Medium

16.3K

367

You are given an integer array `coins`

representing coins of different denominations and an integer `amount`

representing a total amount of money.

Return *the fewest number of coins that you need to make up that amount*. If that amount of money cannot be made up by any combination of the coins, return `-1`

.

You may assume that you have an infinite number of each kind of coin.

**Example 1:**

Input:coins = [1,2,5], amount = 11Output:3Explanation:11 = 5 + 5 + 1

**Example 2:**

Input:coins = [2], amount = 3Output:-1

**Example 3:**

Input:coins = [1], amount = 0Output:0

**Constraints:**

`1 <= coins.length <= 12`

`1 <= coins[i] <= 2`

^{31}- 1`0 <= amount <= 10`

^{4}

Accepted

1.4M

Submissions

3.3M

Acceptance Rate

42.3%

Seen this question in a real interview before?

1/4

Yes

No

Discussion (0)

Related Topics

Copyright ©️ 2023 LeetCode All rights reserved