Add solution #518

Author: JoshCrozier

README.md

@@ -414,6 +414,7 @@
 515|[Find Largest Value in Each Tree Row](./0515-find-largest-value-in-each-tree-row.js)|Medium|
 516|[Longest Palindromic Subsequence](./0516-longest-palindromic-subsequence.js)|Medium|
 517|[Super Washing Machines](./0517-super-washing-machines.js)|Hard|
+518|[Coin Change II](./0518-coin-change-ii.js)|Medium|
 520|[Detect Capital](./0520-detect-capital.js)|Easy|
 521|[Longest Uncommon Subsequence I](./0521-longest-uncommon-subsequence-i.js)|Easy|
 530|[Minimum Absolute Difference in BST](./0530-minimum-absolute-difference-in-bst.js)|Easy|

solutions/0518-coin-change-ii.js

@@ -0,0 +1,33 @@
+/**
+ * 518. Coin Change II
+ * https://leetcode.com/problems/coin-change-ii/
+ * Difficulty: Medium
+ *
+ * You are given an integer array coins representing coins of different denominations and
+ * an integer amount representing a total amount of money.
+ *
+ * Return the number of combinations that make up that amount. If that amount of money
+ * cannot be made up by any combination of the coins, return 0.
+ *
+ * You may assume that you have an infinite number of each kind of coin.
+ *
+ * The answer is guaranteed to fit into a signed 32-bit integer.
+ */
+
+/**
+ * @param {number} amount
+ * @param {number[]} coins
+ * @return {number}
+ */
+var change = function(amount, coins) {
+  const dp = new Array(amount + 1).fill(0);
+  dp[0] = 1;
+
+  for (const coin of coins) {
+    for (let i = coin; i <= amount; i++) {
+      dp[i] += dp[i - coin];
+    }
+  }
+
+  return dp[amount];
+};