Bad question, beats 100% time simple for loop
IntuitionApproachComplexity
Time complexity:

Space complexity:
Code
# Intuition
<!-- Describe your first thoughts on how to solve this problem. -->

# Approach
<!-- Describe your approach to solving the problem. -->

# Complexity
- Time complexity:
<!-- Add your time complexity here, e.g. $$O(n)$$ -->

- Space complexity:
<!-- Add your space complexity here, e.g. $$O(n)$$ -->

# Code
```java []
class Solution {
    public int sumOfSquares(int[] nums) {
        int totalSum = 0;
        int length = nums.length;

        for(int i = 0; i < nums.length; i++){
            int index = i + 1;
            if(length % index == 0){
                totalSum += nums[i] * nums[i];
            }
        }

        return totalSum;
    }
}
```
['Java']