Java || 1000% beats ❤️❤️ || 0(N) || Easy || 🙇‍♂️
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:0(N)\n<!-- Add your time complexity here, e.g. $$O(n)$$ -->\n\n- Space complexity:0(1)\n<!-- Add your space complexity here, e.g. $$O(n)$$ -->\n\n# Code\n```\nclass Solution {\n    public int sumOfSquares(int[] nums) {\n        int ans = 0;\n        for(int i=0; i<nums.length; i++){\n            if(nums.length%(i+1)==0) ans+=(nums[i]*nums[i]);\n        }\n        return ans;\n    }\n}\n```
['Java']