Add problem 3190: Find Minimum Operations to Make All Elements Divisible by Three

Author: EFanZh

src/lib.rs

@@ -2127,6 +2127,7 @@ pub mod problem_3179_find_the_n_th_value_after_k_seconds;
 pub mod problem_3184_count_pairs_that_form_a_complete_day_i;
 pub mod problem_3185_count_pairs_that_form_a_complete_day_ii;
 pub mod problem_3186_maximum_total_damage_with_spell_casting;
+pub mod problem_3190_find_minimum_operations_to_make_all_elements_divisible_by_three;
 pub mod problem_3350_adjacent_increasing_subarrays_detection_ii;
 
 #[cfg(test)]

src/problem_3190_find_minimum_operations_to_make_all_elements_divisible_by_three/iterative.rs

@@ -0,0 +1,25 @@
+pub struct Solution;
+
+// ------------------------------------------------------ snip ------------------------------------------------------ //
+
+impl Solution {
+    pub fn minimum_operations(nums: Vec<i32>) -> i32 {
+        nums.iter().map(|&num| i32::from(num.cast_unsigned() % 3 != 0)).sum()
+    }
+}
+
+// ------------------------------------------------------ snip ------------------------------------------------------ //
+
+impl super::Solution for Solution {
+    fn minimum_operations(nums: Vec<i32>) -> i32 {
+        Self::minimum_operations(nums)
+    }
+}
+
+#[cfg(test)]
+mod tests {
+    #[test]
+    fn test_solution() {
+        super::super::tests::run::<super::Solution>();
+    }
+}

src/problem_3190_find_minimum_operations_to_make_all_elements_divisible_by_three/mod.rs

@@ -0,0 +1,18 @@
+pub mod iterative;
+
+pub trait Solution {
+    fn minimum_operations(nums: Vec<i32>) -> i32;
+}
+
+#[cfg(test)]
+mod tests {
+    use super::Solution;
+
+    pub fn run<S: Solution>() {
+        let test_cases = [(&[1, 2, 3, 4] as &[_], 3), (&[3, 6, 9], 0)];
+
+        for (nums, expected) in test_cases {
+            assert_eq!(S::minimum_operations(nums.to_vec()), expected);
+        }
+    }
+}