2778. Sum of Squares of Special Elements
Read the full problem statement on LeetCode.
Difficulty: easy Acceptance: 81% Topics: Array, Enumeration
View full problem on LeetCode Reading material
Reference solution (spoiler · python)
# Time: O(sqrt(n))
# Space: O(1)
# number theory
class Solution(object):
def sumOfSquares(self, nums):
"""
:type nums: List[int]
:rtype: int
"""
result = 0
for i in xrange(1, int(len(nums)**0.5)+1):
if len(nums)%i:
continue
result += nums[i-1]**2
if len(nums)//i != i:
result += nums[len(nums)//i-1]**2
return result
Solution from kamyu104/LeetCode-Solutions · MIT
Similar questions