Sum of Squares of Special Elements

Problem Description

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.

Key Insights

• The index i is considered special if it is a divisor of n.
• We need to identify all such special indices and compute the sum of the squares of their corresponding values in the array.
• The maximum size of the array is small (up to 50), which allows for straightforward iteration.

Space and Time Complexity

Time Complexity: O(n)
Space Complexity: O(1)

Solution

To solve the problem, we will:

1. Iterate through the indices of the array from 1 to n.
2. For each index, check if it divides n.
3. If it does, we will add the square of the corresponding element from nums to a cumulative sum.
4. Finally, return the computed sum.

We will use a simple loop to achieve this, and since the constraints are small, this approach will be efficient.

Code Solutions