Add problem 2027: Minimum Moves to Convert String

src/lib.rs

@@ -1397,6 +1397,7 @@ pub mod problem_2011_final_value_of_variable_after_performing_operations;
 pub mod problem_2012_sum_of_beauty_in_the_array;
 pub mod problem_2016_maximum_difference_between_increasing_elements;
 pub mod problem_2022_find_original_array_from_doubled_array;
+pub mod problem_2027_minimum_moves_to_convert_string;
 
 #[cfg(test)]
 mod test_utilities;

src/problem_2027_minimum_moves_to_convert_string/iterative.rs

@@ -0,0 +1,37 @@
+pub struct Solution;
+
+// ------------------------------------------------------ snip ------------------------------------------------------ //
+
+impl Solution {
+    pub fn minimum_moves(s: String) -> i32 {
+        let mut result = 0;
+        let mut i = 0;
+
+        while let Some(&c) = s.as_bytes().get(i) {
+            if c == b'O' {
+                i += 1;
+            } else {
+                result += 1;
+                i += 3;
+            }
+        }
+
+        result
+    }
+}
+
+// ------------------------------------------------------ snip ------------------------------------------------------ //
+
+impl super::Solution for Solution {
+    fn minimum_moves(s: String) -> i32 {
+        Self::minimum_moves(s)
+    }
+}
+
+#[cfg(test)]
+mod tests {
+    #[test]
+    fn test_solution() {
+        super::super::tests::run::<super::Solution>();
+    }
+}

src/problem_2027_minimum_moves_to_convert_string/mod.rs

@@ -0,0 +1,18 @@
+pub mod iterative;
+
+pub trait Solution {
+    fn minimum_moves(s: String) -> i32;
+}
+
+#[cfg(test)]
+mod tests {
+    use super::Solution;
+
+    pub fn run<S: Solution>() {
+        let test_cases = [("XXX", 1), ("XXOX", 2), ("OOOO", 0)];
+
+        for (s, expected) in test_cases {
+            assert_eq!(S::minimum_moves(s.to_string()), expected);
+        }
+    }
+}