2778. Sum of Squares of Special Elements

/**
 * Problem: LeetCode 2778 - Sum of Squares of Special Elements
 * Difficulty: Easy
 * Language: Java
 * Author: CodeByTushu
 */
class Solution {
    public int sumOfSquares(int[] nums) {
        int n = nums.length;
        int sum = 0;

        for (int i = 1; i <= n; i++) {
            if (n % i == 0) {
                sum += nums[i - 1] * nums[i - 1];
            }
        }

        return sum;
    }
}

"""
Problem: LeetCode 2778 - Sum of Squares of Special Elements
Difficulty: Easy
Language: Python
Author: CodeByTushu
"""
class Solution:
    def sumOfSquares(self, nums: list[int]) -> int:
        n = len(nums)
        total_sum = 0

        for i in range(1, n + 1):
            if n % i == 0:
                total_sum += nums[i - 1] * nums[i - 1]

        return total_sum

/**
 * Problem: LeetCode 2778 - Sum of Squares of Special Elements
 * Difficulty: Easy
 * Language: C++
 * Author: CodeByTushu
 */
#include <vector>

using namespace std;

/**
 * Problem: LeetCode 2778 - Sum of Squares of Special Elements
 * Difficulty: Easy
 * Language: C++
 * Author: CodeByTushu
 */
class Solution {
public:
    int sumOfSquares(vector<int>& nums) {
        int n = nums.size();
        int sum = 0;

        for (int i = 1; i <= n; i++) {
            if (n % i == 0) {
                sum += nums[i - 1] * nums[i - 1];
            }
        }

        return sum;
    }
};

/**
 * Problem: LeetCode 2778 - Sum of Squares of Special Elements
 * Difficulty: Easy
 * Language: JavaScript
 * Author: CodeByTushu
 */
var sumOfSquares = function(nums) {
    const n = nums.length;
    let sum = 0;

    for (let i = 1; i <= n; i++) {
        if (n % i === 0) {
            sum += nums[i - 1] * nums[i - 1];
        }
    }

    return sum;
};