Add problem 2380: Time Needed to Rearrange a Binary String

Author: EFanZh

src/lib.rs

@@ -1769,6 +1769,7 @@ pub mod problem_2370_longest_ideal_subsequence;
 pub mod problem_2373_largest_local_values_in_a_matrix;
 pub mod problem_2374_node_with_highest_edge_score;
 pub mod problem_2379_minimum_recolors_to_get_k_consecutive_black_blocks;
+pub mod problem_2380_time_needed_to_rearrange_a_binary_string;
 
 #[cfg(test)]
 mod test_utilities;

src/problem_2380_time_needed_to_rearrange_a_binary_string/iterative.rs

@@ -0,0 +1,36 @@
+pub struct Solution;
+
+// ------------------------------------------------------ snip ------------------------------------------------------ //
+
+impl Solution {
+    pub fn seconds_to_remove_occurrences(s: String) -> i32 {
+        let mut zeroes = 0;
+        let mut cost = 0_u16;
+
+        s.bytes().skip_while(|&c| c == b'1').for_each(|c| {
+            if c == b'0' {
+                zeroes += 1;
+            } else {
+                cost = zeroes.max(cost + 1);
+            }
+        });
+
+        i32::from(cost)
+    }
+}
+
+// ------------------------------------------------------ snip ------------------------------------------------------ //
+
+impl super::Solution for Solution {
+    fn seconds_to_remove_occurrences(s: String) -> i32 {
+        Self::seconds_to_remove_occurrences(s)
+    }
+}
+
+#[cfg(test)]
+mod tests {
+    #[test]
+    fn test_solution() {
+        super::super::tests::run::<super::Solution>();
+    }
+}

src/problem_2380_time_needed_to_rearrange_a_binary_string/mod.rs

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