Add solution #293

Author: JoshCrozier

README.md

@@ -281,6 +281,7 @@
 290|[Word Pattern](./solutions/0290-word-pattern.js)|Easy|
 291|[Word Pattern II](./solutions/0291-word-pattern-ii.js)|Medium|
 292|[Nim Game](./solutions/0292-nim-game.js)|Easy|
+293|[Flip Game](./solutions/0293-flip-game.js)|Easy|
 295|[Find Median from Data Stream](./solutions/0295-find-median-from-data-stream.js)|Hard|
 297|[Serialize and Deserialize Binary Tree](./solutions/0297-serialize-and-deserialize-binary-tree.js)|Hard|
 299|[Bulls and Cows](./solutions/0299-bulls-and-cows.js)|Medium|

solutions/0293-flip-game.js

@@ -0,0 +1,32 @@
+/**
+ * 293. Flip Game
+ * https://leetcode.com/problems/flip-game/
+ * Difficulty: Easy
+ *
+ * You are playing a Flip Game with your friend.
+ *
+ * You are given a string currentState that contains only '+' and '-'. You and your friend take
+ * turns to flip two consecutive "++" into "--". The game ends when a person can no longer make
+ * a move, and therefore the other person will be the winner.
+ *
+ * Return all possible states of the string currentState after one valid move. You may return
+ * the answer in any order. If there is no valid move, return an empty list [].
+ */
+
+/**
+ * @param {string} currentState
+ * @return {string[]}
+ */
+var generatePossibleNextMoves = function(currentState) {
+  const results = [];
+
+  for (let i = 0; i < currentState.length - 1; i++) {
+    if (currentState[i] === '+' && currentState[i + 1] === '+') {
+      results.push(
+        currentState.slice(0, i) + '--' + currentState.slice(i + 2)
+      );
+    }
+  }
+
+  return results;
+};