Add solution #1510

Author: JoshCrozier

README.md

@@ -1,4 +1,4 @@
-# 1,338 LeetCode solutions in JavaScript
+# 1,339 LeetCode solutions in JavaScript
 
 [https://leetcodejavascript.com](https://leetcodejavascript.com)
 
@@ -1154,6 +1154,7 @@
 1507|[Reformat Date](./solutions/1507-reformat-date.js)|Easy|
 1508|[Range Sum of Sorted Subarray Sums](./solutions/1508-range-sum-of-sorted-subarray-sums.js)|Medium|
 1509|[Minimum Difference Between Largest and Smallest Value in Three Moves](./solutions/1509-minimum-difference-between-largest-and-smallest-value-in-three-moves.js)|Medium|
+1510|[Stone Game IV](./solutions/1510-stone-game-iv.js)|Hard|
 1512|[Number of Good Pairs](./solutions/1512-number-of-good-pairs.js)|Easy|
 1519|[Number of Nodes in the Sub-Tree With the Same Label](./solutions/1519-number-of-nodes-in-the-sub-tree-with-the-same-label.js)|Medium|
 1524|[Number of Sub-arrays With Odd Sum](./solutions/1524-number-of-sub-arrays-with-odd-sum.js)|Medium|

solutions/1510-stone-game-iv.js

@@ -0,0 +1,34 @@
+/**
+ * 1510. Stone Game IV
+ * https://leetcode.com/problems/stone-game-iv/
+ * Difficulty: Hard
+ *
+ * Alice and Bob take turns playing a game, with Alice starting first.
+ *
+ * Initially, there are n stones in a pile. On each player's turn, that player makes a move
+ * consisting of removing any non-zero square number of stones in the pile.
+ *
+ * Also, if a player cannot make a move, he/she loses the game.
+ *
+ * Given a positive integer n, return true if and only if Alice wins the game otherwise return
+ * false, assuming both players play optimally.
+ */
+
+/**
+ * @param {number} n
+ * @return {boolean}
+ */
+var winnerSquareGame = function(n) {
+  const dp = new Array(n + 1).fill(false);
+
+  for (let stones = 1; stones <= n; stones++) {
+    for (let square = 1; square * square <= stones; square++) {
+      if (!dp[stones - square * square]) {
+        dp[stones] = true;
+        break;
+      }
+    }
+  }
+
+  return dp[n];
+};