322. Coin Change

Author: Gapur

solution/0322.Coin Change/README.md

@@ -0,0 +1,19 @@
+# 322. Coin Change
+
+You are given coins of different denominations and a total amount of money amount. Write a function to compute 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.
+
+## Example 1:
+```
+Input: coins = [1, 2, 5], amount = 11
+Output: 3 
+Explanation: 11 = 5 + 5 + 1
+```
+
+## Example 2:
+```
+Input: coins = [2], amount = 3
+Output: -1
+```
+
+## Note:
+You may assume that you have an infinite number of each kind of coin.

solution/0322.Coin Change/Solution.js

@@ -0,0 +1,13 @@
+const coinChange = function(coins, amount) {
+  let dp = Array(amount + 1).fill(amount + 1);
+  dp[0] = 0;
+  for (let i = 1; i <= amount; i++) {
+      for (let j = 0; j < coins.length; j++) {
+          if (coins[j] <= i) {
+              dp[i] = Math.min(dp[i], dp[i - coins[j]] + 1);
+          }
+      }
+  }
+  
+  return dp[amount] > amount ? -1 : dp[amount];
+};

solution/README.md

@@ -867,6 +867,8 @@
 │   └── Solution.cpp
 ├── 0319.Bulb Switcher
 │   └── Solution.java
+├── 0322.Coin Change
+│   └── Solution.js
 ├── 0326.Power of Three
 │   └── Solution.js
 ├── 0328.Odd Even Linked List