Search⌘ K
AI Features

Solution: Sum of Squares of Special Elements

Explore how to find and sum the squares of special elements in a 1-indexed array. Understand the divisibility condition that makes an element special and apply a straightforward iterative solution for efficient calculation.

Statement

You are given a 11-indexed integer array nums of length n.

An element nums[i] is considered special if i divides n evenly, meaning n % i == 0.

Return the sum of the squares of all special elements in nums.

Constraints:

  • 11 \leq nums.length == n ...