easy and simple solution
IntuitionApproachComplexity

Time complexity: O(n)


Space complexity: O(1)

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

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

# Complexity
- Time complexity: O(n)

- Space complexity: O(1)
<!-- Add your space complexity here, e.g. $$O(n)$$ -->
# Code
```java []
class Solution {
    public int sumOfSquares(int[] nums) {
        int result = 0;
        for(int i=1; i<=nums.length; i++)
        {
            if(nums.length % i == 0)
            {
                result += nums[i-1]*nums[i-1];
            }
        }
        return result;
    }
}
```
['Java']