Good time complexity lol
Intuition\n Describe your first thoughts on how to solve this problem. \n\n# Approach\n Describe your approach to solving the problem. \n\n# Complexity\n- Time 
# Intuition\n<!-- Describe your first thoughts on how to solve this problem. -->\n\n# Approach\n<!-- Describe your approach to solving the problem. -->\n\n# Complexity\n- Time complexity:\n<!-- Add your time complexity here, e.g. $$O(n)$$ -->\n\n- Space complexity:\n<!-- Add your space complexity here, e.g. $$O(n)$$ -->\n\n# Code\n```cpp []\nclass Solution {\npublic:\n    int sumOfSquares(vector<int>& nums) {\n        int n = nums.size();\n        int sum = 0;\n        for(int i=1;i<=nums.size();i++)\n        {\n            if(n%i==0)\n            {\n                int product = (nums[i-1]*nums[i-1]);\n                sum+=product;\n            }\n        }\n        return sum;\n    }\n};\n```
['C++']