Added solution for min moves

anxious-coder-lhs · anxious-coder-lhs · commit d3c9afaafee9 · 2020-11-12T15:14:18.000+05:30
diff --git a/README.md b/README.md
@@ -59,6 +59,7 @@ Happy to accept any contributions to this in any langugage.
 24. [Leet Code 151 - Reverse Words in a String](https://leetcode.com/problems/reverse-words-in-a-string/) | [Solution](level_medium/LeetCode_151_Reverse_Words_In_a_String.ts)
 25. [Leet Code 1647 - Minimum Deletions to Make Character Frequency Unique](https://leetcode.com/problems/minimum-deletions-to-make-character-frequencies-unique/) | [Solution](level_medium/LeetCode_1647_Min_Deletions_For_Unique_Freq.ts)
 26. [Microsoft OA - Max Sum of Numbers with Equal Sum Digits](https://leetcode.com/discuss/interview-question/915683/) | [Solution](./level_medium/MaxSumOfNumbersWithEqualSumOfDigit.ts)
+27. [Microsoft OA - Min Moves to Make String without 3 Identical Chars](https://molchevskyi.medium.com/microsoft-interview-tasks-min-moves-to-make-string-without-3-identical-consecutive-letters-abe61ed51a10) | [Solution](./level_medium/MinMovesToMakeStringWithout3IdenticalChars.ts)
 
 
 ## Hard
diff --git a/level_medium/MinMovesToMakeStringWithout3IdenticalChars.ts b/level_medium/MinMovesToMakeStringWithout3IdenticalChars.ts
@@ -0,0 +1,40 @@
+import { count, countReset } from "console";
+
+/**
+ * https://leetcode.com/discuss/interview-question/398026/
+ * 
+ * Solution uses the sliding window pattern. Here, the sliding window is created for the entire length of the
+ * consequtive letters. The sliding window can be fixed, but that is not an optimal correct solution. The sliding
+ * window with repeated characters allow for choosing the min possible swaps which would only be repeat/3
+ * 
+ * Time: O(n), Space: O(1)
+ * 
+ * @param input 
+ */
+function findMinMoves(input: string): number {
+
+    if (input.length < 3) return 0;
+    let last = '', curr = '', swaps = 0, counter = 1, idx = 0
+    while(true) {
+        curr = input[idx] || ''
+        if (last === curr) counter++
+        else {
+            if (counter >= 3) {
+                swaps +=  Math.floor(counter / 3)
+            }
+            counter = 1
+        }
+        last = curr
+        idx++
+        if (curr === '') break;
+    }
+
+    return swaps;
+}
+
+console.log(findMinMoves("baaaaa"))
+console.log(findMinMoves("baaabbaabbba"))
+console.log(findMinMoves("baabab"))
+console.log(findMinMoves("baaaab"))
+console.log(findMinMoves("baaaaaab"))
+console.log(findMinMoves("baaaaaaaaaab"))
