Add solution #2027

JoshCrozier · JoshCrozier · commit 4d67380ace68 · 2023-01-02T17:25:24.000-06:00
diff --git a/2027-minimum-moves-to-convert-string.js b/2027-minimum-moves-to-convert-string.js
@@ -0,0 +1,21 @@
+/**
+ * 2027. Minimum Moves to Convert String
+ * https://leetcode.com/problems/minimum-moves-to-convert-string/
+ * Difficulty: Easy
+ *
+ * You are given a string s consisting of n characters which are either 'X' or 'O'.
+ *
+ * A move is defined as selecting three consecutive characters of s and converting them
+ * to 'O'. Note that if a move is applied to the character 'O', it will stay the same.
+ *
+ * Return the minimum number of moves required so that all the characters of s are
+ * converted ]to 'O'.
+ */
+
+/**
+ * @param {string} s
+ * @return {number}
+ */
+var minimumMoves = function(s) {
+  return s.match(/X.{0,2}/g)?.length ?? 0;
+};
diff --git a/README.md b/README.md
@@ -277,6 +277,7 @@
 2000|[Reverse Prefix of Word](./2000-reverse-prefix-of-word.js)|Easy|
 2011|[Final Value of Variable After Performing Operations](./2011-final-value-of-variable-after-performing-operations.js)|Easy|
 2016|[Maximum Difference Between Increasing Elements](./2016-maximum-difference-between-increasing-elements.js)|Easy|
+2027|[Minimum Moves to Convert String](./2027-minimum-moves-to-convert-string.js)|Easy|
 2047|[Number of Valid Words in a Sentence](./2047-number-of-valid-words-in-a-sentence.js)|Easy|
 2053|[Kth Distinct String in an Array](./2053-kth-distinct-string-in-an-array.js)|Medium|
 2085|[Count Common Words With One Occurrence](./2085-count-common-words-with-one-occurrence.js)|Easy|
