Sum of squares of special elements

Array Enumeration

82.0% acceptance

Feb 25, 2026

318

139

You are given a 1-indexed integer array nums of length n. An element nums[i] of nums is called special if i divides n, i.e. n % i == 0. Return the sum of the squares of all special elements of nums.

Solution

Rust

Time O(n)

Space O(1)

LeetCode

solution.rs

impl Solution {
  pub fn sum_of_squares(nums: Vec<i32>) -> i32 {
    let n = nums.len() as i32;
    (1..=n)
      .filter(|&i| n % i == 0)
      .map(|i| nums[(i - 1) as usize].pow(2))
      .sum()
  }
}