Sum of Squares of Special Elements
Sum of Squares of Special Elements asks you to examine a one-indexed integer array and return the sum of squared values at positions that evenly divide the array length.
We'll cover the following...
We'll cover the following...
Statement
You are given a 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.
...