Add solution #3227

Author: JoshCrozier

README.md

@@ -2683,6 +2683,7 @@
 3215|[Count Triplets with Even XOR Set Bits II](./solutions/3215-count-triplets-with-even-xor-set-bits-ii.js)|Medium|
 3221|[Maximum Array Hopping Score II](./solutions/3221-maximum-array-hopping-score-ii.js)|Medium|
 3223|[Minimum Length of String After Operations](./solutions/3223-minimum-length-of-string-after-operations.js)|Medium|
+3227|[Vowels Game in a String](./solutions/3227-vowels-game-in-a-string.js)|Medium|
 3231|[Minimum Number of Increasing Subsequence to Be Removed](./solutions/3231-minimum-number-of-increasing-subsequence-to-be-removed.js)|Hard|
 3237|[Alt and Tab Simulation](./solutions/3237-alt-and-tab-simulation.js)|Medium|
 3247|[Number of Subsequences with Odd Sum](./solutions/3247-number-of-subsequences-with-odd-sum.js)|Medium|

solutions/3227-vowels-game-in-a-string.js

@@ -0,0 +1,35 @@
+/**
+ * 3227. Vowels Game in a String
+ * https://leetcode.com/problems/vowels-game-in-a-string/
+ * Difficulty: Medium
+ *
+ * Alice and Bob are playing a game on a string.
+ *
+ * You are given a string s, Alice and Bob will take turns playing the following game where
+ * Alice starts first:
+ * - On Alice's turn, she has to remove any non-empty substring from s that contains an odd
+ *   number of vowels.
+ * - On Bob's turn, he has to remove any non-empty substring from s that contains an even
+ *   number of vowels.
+ *
+ * The first player who cannot make a move on their turn loses the game. We assume that both
+ * Alice and Bob play optimally.
+ *
+ * Return true if Alice wins the game, and false otherwise.
+ *
+ * The English vowels are: a, e, i, o, and u.
+ */
+
+/**
+ * @param {string} s
+ * @return {boolean}
+ */
+var doesAliceWin = function(s) {
+  const vowels = new Set(['a', 'e', 'i', 'o', 'u']);
+  for (const char of s) {
+    if (vowels.has(char)) {
+      return true;
+    }
+  }
+  return false;
+};