Add problem 2778: Sum of Squares of Special Elements

Author: EFanZh

src/lib.rs

@@ -1964,6 +1964,7 @@ pub mod problem_2765_longest_alternating_subarray;
 pub mod problem_2766_relocate_marbles;
 pub mod problem_2769_find_the_maximum_achievable_number;
 pub mod problem_2771_longest_non_decreasing_subarray_from_two_arrays;
+pub mod problem_2778_sum_of_squares_of_special_elements;
 
 #[cfg(test)]
 mod test_utilities;

src/problem_2778_sum_of_squares_of_special_elements/iterative.rs

@@ -0,0 +1,31 @@
+pub struct Solution;
+
+// ------------------------------------------------------ snip ------------------------------------------------------ //
+
+impl Solution {
+    pub fn sum_of_squares(nums: Vec<i32>) -> i32 {
+        let n = nums.len() as u32;
+
+        (1..)
+            .zip(nums)
+            .filter(|&(i, _)| n % i == 0)
+            .map(|(_, num)| num * num)
+            .sum()
+    }
+}
+
+// ------------------------------------------------------ snip ------------------------------------------------------ //
+
+impl super::Solution for Solution {
+    fn sum_of_squares(nums: Vec<i32>) -> i32 {
+        Self::sum_of_squares(nums)
+    }
+}
+
+#[cfg(test)]
+mod tests {
+    #[test]
+    fn test_solution() {
+        super::super::tests::run::<super::Solution>();
+    }
+}

src/problem_2778_sum_of_squares_of_special_elements/mod.rs

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