LC 2914. Minimum Number of Changes to Make Binary String Beautiful (Rust)

Author: raul-sauco

README.md

@@ -770,6 +770,7 @@ to the solution in this repository.
 | [2849. Determine if a Cell Is Reachable at a Given Time][lc2849]                              | 🟠 Medium  | [![rust](res/rs.png)][lc2849rs]                                                                       |
 | [2864. Maximum Odd Binary Number][lc2864]                                                     | 🟢 Easy    | [![rust](res/rs.png)][lc2864rs]                                                                       |
 | [2870. Minimum Number of Operations to Make Array Empty][lc2870]                              | 🟠 Medium  | [![rust](res/rs.png)][lc2870rs]                                                                       |
+| [2914. Minimum Number of Changes to Make Binary String Beautiful][lc2914]                     | 🟠 Medium  | [![rust](res/rs.png)][lc2914rs]                                                                       |
 | [2938. Separate Black and White Balls][lc2938]                                                | 🟠 Medium  | [![rust](res/rs.png)][lc2938rs]                                                                       |
 | [2958. Length of Longest Subarray With at Most K Frequency][lc2958]                           | 🟠 Medium  | [![rust](res/rs.png)][lc2958rs]                                                                       |
 | [2962. Count Subarrays Where Max Element Appears at Least K Times][lc2962]                    | 🟠 Medium  | [![rust](res/rs.png)][lc2962rs]                                                                       |
@@ -2474,6 +2475,8 @@ to the solution in this repository.
 [lc2864rs]: leetcode/maximum-odd-binary-number.rs
 [lc2870]: https://leetcode.com/problems/minimum-number-of-operations-to-make-array-empty/
 [lc2870rs]: leetcode/minimum-number-of-operations-to-make-array-empty.rs
+[lc2914]: https://leetcode.com/problems/minimum-number-of-changes-to-make-binary-string-beautiful/
+[lc2914rs]: leetcode/minimum-number-of-changes-to-make-binary-string-beautiful.rs
 [lc2938]: https://leetcode.com/problems/separate-black-and-white-balls/
 [lc2938rs]: leetcode/separate-black-and-white-balls.rs
 [lc2958]: https://leetcode.com/problems/length-of-longest-subarray-with-at-most-k-frequency/

leetcode/minimum-number-of-changes-to-make-binary-string-beautiful.rs

@@ -0,0 +1,54 @@
+// 2914. Minimum Number of Changes to Make Binary String Beautiful
+// 🟠 Medium
+//
+// https://leetcode.com/problems/minimum-number-of-changes-to-make-binary-string-beautiful/
+//
+// Tags: String
+
+struct Solution;
+impl Solution {
+    /// Iterate over pairs of values, if they don't match, we need to do 1 more change.
+    ///
+    /// Time complexity: O(n) - We iterate over pairs of values in the input checking if they match
+    /// in constant time.
+    /// Space complexity: O(n) - The byte slice gets allocated, not sure how to avoid that.
+    ///
+    /// Runtime 1 ms Beats 100%
+    /// Memory 2.27 MB Beats 83%
+    pub fn min_changes(s: String) -> i32 {
+        s.as_bytes()
+            .chunks(2)
+            .map(|chunk| if chunk[0] == chunk[1] { 0 } else { 1 })
+            .sum()
+    }
+}
+
+// Tests.
+fn main() {
+    let tests = [("1001", 2), ("10", 1), ("0000", 0), ("11000111", 1)];
+    println!("\n\x1b[92m» Running {} tests...\x1b[0m", tests.len());
+    let mut success = 0;
+    for (i, t) in tests.iter().enumerate() {
+        let res = Solution::min_changes(t.0.to_owned());
+        if res == t.1 {
+            success += 1;
+            println!("\x1b[92m✔\x1b[95m Test {} passed!\x1b[0m", i);
+        } else {
+            println!(
+                "\x1b[31mx\x1b[95m Test {} failed expected: {:?} but got {}!!\x1b[0m",
+                i, t.1, res
+            );
+        }
+    }
+    println!();
+    if success == tests.len() {
+        println!("\x1b[30;42m✔ All tests passed!\x1b[0m")
+    } else if success == 0 {
+        println!("\x1b[31mx \x1b[41;37mAll tests failed!\x1b[0m")
+    } else {
+        println!(
+            "\x1b[31mx\x1b[95m {} tests failed!\x1b[0m",
+            tests.len() - success
+        )
+    }
+}