Available question text
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).
Related questions
Continue with questions that share topics or the same question type.
- Longest Mountain in Array
Coding · Array · Dynamic Programming · Enumeration
- Maximum Score with Co-Prime Element
Coding · Array · Combinatorics · Enumeration
- Removing Minimum Number of Magic Beans
Coding · Array · Enumeration · Greedy
- Consecutive Numbers Sum
Coding · Enumeration · Math
Sources · 2 references
These records explain where the question appears. A company tag or candidate report does not guarantee a future interview question.
Hello Interview · 1 record
No company association
Leetcode 2778. Sum of Squares of Special Elements
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source
LeetCode company tags · 1 record
Bloomberg
Sum of Squares of Special Elements
Reported date not specified · Source window: 30d
Source snapshot: Oct 20, 2026
Source frequency score: 59.6. This is not an interview probability.
View source