Add solution #2038

Author: JoshCrozier

README.md

@@ -1,4 +1,4 @@
-# 1,700 LeetCode solutions in JavaScript
+# 1,701 LeetCode solutions in JavaScript
 
 [https://leetcodejavascript.com](https://leetcodejavascript.com)
 
@@ -1562,6 +1562,7 @@
 2033|[Minimum Operations to Make a Uni-Value Grid](./solutions/2033-minimum-operations-to-make-a-uni-value-grid.js)|Medium|
 2035|[Partition Array Into Two Arrays to Minimize Sum Difference](./solutions/2035-partition-array-into-two-arrays-to-minimize-sum-difference.js)|Hard|
 2037|[Minimum Number of Moves to Seat Everyone](./solutions/2037-minimum-number-of-moves-to-seat-everyone.js)|Easy|
+2038|[Remove Colored Pieces if Both Neighbors are the Same Color](./solutions/2038-remove-colored-pieces-if-both-neighbors-are-the-same-color.js)|Medium|
 2047|[Number of Valid Words in a Sentence](./solutions/2047-number-of-valid-words-in-a-sentence.js)|Easy|
 2053|[Kth Distinct String in an Array](./solutions/2053-kth-distinct-string-in-an-array.js)|Medium|
 2071|[Maximum Number of Tasks You Can Assign](./solutions/2071-maximum-number-of-tasks-you-can-assign.js)|Hard|

solutions/2038-remove-colored-pieces-if-both-neighbors-are-the-same-color.js

@@ -0,0 +1,38 @@
+/**
+ * 2038. Remove Colored Pieces if Both Neighbors are the Same Color
+ * https://leetcode.com/problems/remove-colored-pieces-if-both-neighbors-are-the-same-color/
+ * Difficulty: Medium
+ *
+ * There are n pieces arranged in a line, and each piece is colored either by 'A' or by 'B'.
+ * You are given a string colors of length n where colors[i] is the color of the ith piece.
+ *
+ * Alice and Bob are playing a game where they take alternating turns removing pieces from the
+ * line. In this game, Alice moves first.
+ * - Alice is only allowed to remove a piece colored 'A' if both its neighbors are also colored
+ *   'A'. She is not allowed to remove pieces that are colored 'B'.
+ * - Bob is only allowed to remove a piece colored 'B' if both its neighbors are also colored
+ *   'B'. He is not allowed to remove pieces that are colored 'A'.
+ * - Alice and Bob cannot remove pieces from the edge of the line.
+ * - If a player cannot make a move on their turn, that player loses and the other player wins.
+ *
+ * Assuming Alice and Bob play optimally, return true if Alice wins, or return false if Bob wins.
+ */
+
+/**
+ * @param {string} colors
+ * @return {boolean}
+ */
+var winnerOfGame = function(colors) {
+  let aliceMoves = 0;
+  let bobMoves = 0;
+
+  for (let i = 1; i < colors.length - 1; i++) {
+    if (colors[i] === 'A' && colors[i - 1] === 'A' && colors[i + 1] === 'A') {
+      aliceMoves++;
+    } else if (colors[i] === 'B' && colors[i - 1] === 'B' && colors[i + 1] === 'B') {
+      bobMoves++;
+    }
+  }
+
+  return aliceMoves > bobMoves;
+};