Add solution #279

Author: JoshCrozier

README.md

@@ -222,6 +222,7 @@
 274|[H-Index](./0274-h-index.js)|Medium|
 275|[H-Index II](./0275-h-index-ii.js)|Medium|
 278|[First Bad Version](./0278-first-bad-version.js)|Medium|
+279|[Perfect Squares](./0279-perfect-squares.js)|Medium|
 282|[Expression Add Operators](./0282-expression-add-operators.js)|Hard|
 283|[Move Zeroes](./0283-move-zeroes.js)|Easy|
 290|[Word Pattern](./0290-word-pattern.js)|Easy|

solutions/0279-perfect-squares.js

@@ -0,0 +1,27 @@
+/**
+ * 279. Perfect Squares
+ * https://leetcode.com/problems/perfect-squares/
+ * Difficulty: Medium
+ *
+ * Given an integer n, return the least number of perfect square numbers that sum to n.
+ *
+ * A perfect square is an integer that is the square of an integer; in other words, it is
+ * the product of some integer with itself. For example, 1, 4, 9, and 16 are perfect squares
+ * while 3 and 11 are not.
+ */
+
+/**
+ * @param {number} n
+ * @return {number}
+ */
+var numSquares = function(n) {
+  const dp = new Array(n + 1).fill(0).map((_, i) => !i ? 0 : Infinity);
+
+  for (let i = 1; i <= n; i++) {
+    for (let j = 1; j * j <= i; j++) {
+      dp[i] = Math.min(dp[i], dp[i - j * j] + 1);
+    }
+  }
+
+  return dp[n];
+};