Sum of Squares of Special Elements — LeetCode 2778 Python Solution
EasyArrayEnumeration
- Problem
- #2778
- Reading time
- 2 min
- Source
- leetcode.com
The problem
You are given a 1-indexed integer array nums of length n. An element nums[i] of nums is called special if i divides n, i.e.
Example
- Input
- nums = [1,2,3,4]
- Output
- 21
- Explanation
- There are exactly 3 special elements in nums: nums[1] since 1 divides 4, nums[2] since 2 divides 4, and nums[4] since 4 divides 4.
Python solution
Python
class Solution:
def sumOfSquares(self, nums: List[int]) -> int:
n = len(nums)
return sum(x * x for i, x in enumerate(nums, 1) if n % i == 0)Complexity
| Measure | Complexity |
|---|---|
| Time | O(n) |
| Space | O(1) to O(n) auxiliary |
Related problems
LeetCode 1534Count Good TripletsEasyLeetCode 1566Detect Pattern of Length M Repeated K or More TimesEasyLeetCode 1620Coordinate With Maximum Network QualityMediumLeetCode 2735Collecting ChocolatesMediumLeetCode 2765Longest Alternating SubarrayEasyLeetCode 2934Minimum Operations to Maximize Last Elements in ArraysMedium
Frequently asked questions
- How hard is LeetCode 2778. Sum of Squares of Special Elements?
- LeetCode 2778. Sum of Squares of Special Elements is rated Easy on LeetCode.
- What topics does LeetCode 2778. Sum of Squares of Special Elements cover?
- LeetCode 2778. Sum of Squares of Special Elements is tagged Array and Enumeration on LeetCode.