Search⌘ K
AI Features

Solution: Sum of Squares of Special Elements

Explore how to identify special elements in a 1-indexed array where positions divide the array length evenly. Learn to calculate the sum of their squares efficiently, understanding the solution's logic, time, and space complexities, to strengthen your coding interview problem-solving skills.

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