https://algorithm.liangqin.ren/tags/enumeration/Recent content in Enumeration on Algorithm SolutionsHugo -- gohugo.ioSat, 10 Oct 2026 11:56:54 -0500https://algorithm.liangqin.ren/leetcode/2778/Sat, 10 Oct 2026 11:56:54 -0500https://algorithm.liangqin.ren/leetcode/2778/1. Description Treat nums, an integer array of length n, as indexed from 1 through n. An element is special when its index is a divisor of n. Compute the sum obtained by squaring each special element and adding the results. 2. Example Example 1 Input: nums = [1,2,3,4] Output: 21 Explanation: The qualifying positions are 1, 2, and 4, giving $1^2 + 2^2 + 4^2 = 21$. Example 2 Input: nums = [2,7,1,19,18,3]