Search⌘ K
AI Features

Solution: Sum of Squares of Special Elements

Understand how to identify special elements in an integer array whose indices divide the array length evenly, then calculate the sum of their squares. Explore a clear, step-by-step solution with O(n) time complexity and constant space use, helping you apply this pattern in similar coding problems.

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 ...