Add solution #292

Author: JoshCrozier

README.md

@@ -225,6 +225,7 @@
 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|
+292|[Nim Game](./0292-nim-game.js)|Easy|
 295|[Find Median from Data Stream](./0295-find-median-from-data-stream.js)|Hard|
 303|[Range Sum Query - Immutable](./0303-range-sum-query-immutable.js)|Easy|
 316|[Remove Duplicate Letters](./0316-remove-duplicate-letters.js)|Medium|

solutions/0292-nim-game.js

@@ -0,0 +1,22 @@
+/**
+ * 292. Nim Game
+ * https://leetcode.com/problems/nim-game/
+ * Difficulty: Easy
+ *
+ * You are playing the following Nim Game with your friend:
+ * - Initially, there is a heap of stones on the table.
+ * - You and your friend will alternate taking turns, and you go first.
+ * - On each turn, the person whose turn it is will remove 1 to 3 stones from the heap.
+ * - The one who removes the last stone is the winner.
+ *
+ * Given n, the number of stones in the heap, return true if you can win the game assuming
+ * both you and your friend play optimally, otherwise return false.
+ */
+
+/**
+ * @param {number} n
+ * @return {boolean}
+ */
+var canWinNim = function(n) {
+  return n % 4 !== 0;
+};