Search
⌘K
Leetcode 2778. Sum of Squares of Special Elements
Given a 1-indexed integer array nums of length n, compute the sum of squares of all elements at indices i that divide n (i.e., n % i == 0).
Question Timeline
See when this question was last asked and where, including any notes left by other candidates.
All Regions
Comments
Hello Interview Premium
Your account is free and you can post anonymously if you choose.