Add problem 2138: Divide a String Into Groups of Size k

Author: Spxg

src/lib.rs

@@ -639,6 +639,7 @@ pub mod problem_1961_check_if_string_is_a_prefix_of_array;
 pub mod problem_1962_remove_stones_to_minimize_the_total;
 pub mod problem_2032_two_out_of_three;
 pub mod problem_2108_find_first_palindromic_string_in_the_array;
+pub mod problem_2138_divide_a_string_into_groups_of_size_k;
 pub mod problem_2348_number_of_zero_filled_subarrays;
 
 #[cfg(test)]

src/problem_2138_divide_a_string_into_groups_of_size_k/iterative.rs

@@ -0,0 +1,31 @@
+pub struct Solution;
+
+impl Solution {
+    pub fn divide_string(s: String, k: i32, fill: char) -> Vec<String> {
+        let mut result = vec![];
+        let extra = (k - (s.len() as i32 % k)) as usize;
+        let s = s.into_bytes();
+        for bytes in s.chunks(k as usize) {
+            let mut bytes = bytes.to_vec();
+            if bytes.len() != k as usize {
+                bytes.extend(std::iter::repeat_n(fill as u8, extra));
+            }
+            result.push(String::from_utf8(bytes).unwrap());
+        }
+        result
+    }
+}
+
+impl super::Solution for Solution {
+    fn divide_string(s: String, k: i32, fill: char) -> Vec<String> {
+        Self::divide_string(s, k, fill)
+    }
+}
+
+#[cfg(test)]
+mod tests {
+    #[test]
+    fn test_solution() {
+        super::super::tests::run::<super::Solution>();
+    }
+}

src/problem_2138_divide_a_string_into_groups_of_size_k/mod.rs

@@ -0,0 +1,21 @@
+pub mod iterative;
+
+pub trait Solution {
+    fn divide_string(s: String, k: i32, fill: char) -> Vec<String>;
+}
+
+#[cfg(test)]
+mod tests {
+    use super::Solution;
+
+    pub fn run<S: Solution>() {
+        let test_cases = [
+            (("abcdefghi", 3, 'x'), &["abc", "def", "ghi"] as &[_]),
+            (("abcdefghij", 3, 'x'), &["abc", "def", "ghi", "jxx"]),
+        ];
+
+        for ((s, k, fill), expected) in test_cases {
+            assert_eq!(S::divide_string(s.to_string(), k, fill), expected);
+        }
+    }
+}