Beats 100% users in time 😎 | JAVA |
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```\nclass Solution {\n    public int sumOfSquares(int[] nums) \n    {\n        int i,n,sum=0;\n        n = nums.length;\n        for(i=0;i<n;i++)\n        {\n            if(n% (i+1) ==0)\n            {\n                sum = sum + (nums[i]*nums[i]);\n            }\n        }\n        return sum;\n    }\n}\n```
['Java']