0(n)
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
```cpp []
class Solution {
public:
    int sumOfSquares(vector<int>& nums) {
        int result = 0;
        for(int i = 0; i < nums.size(); i++){
            int n = nums.size();
            if (n%(i+1) == 0){ // i+1 since it's 1 indexed.
                result+=(nums[i]*nums[i]);
            }
        }
        return result;
    }
};
```
['C++']