Add problem 3014: Minimum Number of Pushes to Type Word I

Author: EFanZh

src/lib.rs

@@ -2047,6 +2047,7 @@ pub mod problem_3005_count_elements_with_maximum_frequency;
 pub mod problem_3010_divide_an_array_into_subarrays_with_minimum_cost_i;
 pub mod problem_3011_find_if_array_can_be_sorted;
 pub mod problem_3012_minimize_length_of_array_using_operations;
+pub mod problem_3014_minimum_number_of_pushes_to_type_word_i;
 
 #[cfg(test)]
 mod test_utilities;

src/problem_3014_minimum_number_of_pushes_to_type_word_i/greedy.rs

@@ -0,0 +1,29 @@
+pub struct Solution;
+
+// ------------------------------------------------------ snip ------------------------------------------------------ //
+
+impl Solution {
+    pub fn minimum_pushes(word: String) -> i32 {
+        let n = word.len();
+        let quotient = n / 8;
+        let remainder = n % 8;
+
+        (4 * (1 + quotient) * quotient + (quotient + 1) * remainder) as _
+    }
+}
+
+// ------------------------------------------------------ snip ------------------------------------------------------ //
+
+impl super::Solution for Solution {
+    fn minimum_pushes(word: String) -> i32 {
+        Self::minimum_pushes(word)
+    }
+}
+
+#[cfg(test)]
+mod tests {
+    #[test]
+    fn test_solution() {
+        super::super::tests::run::<super::Solution>();
+    }
+}

src/problem_3014_minimum_number_of_pushes_to_type_word_i/mod.rs

@@ -0,0 +1,18 @@
+pub mod greedy;
+
+pub trait Solution {
+    fn minimum_pushes(word: String) -> i32;
+}
+
+#[cfg(test)]
+mod tests {
+    use super::Solution;
+
+    pub fn run<S: Solution>() {
+        let test_cases = [("abcde", 5), ("xycdefghij", 12)];
+
+        for (word, expected) in test_cases {
+            assert_eq!(S::minimum_pushes(word.to_string()), expected);
+        }
+    }
+}