easy peasy
Intuition\n Describe your first thoughts on how to solve this problem. \n\n# Approach\n Describe your approach to solving the problem. \n\n# Complexity\n- Time 
# Intuition\n<!-- Describe your first thoughts on how to solve this problem. -->\n\n# Approach\n<!-- Describe your approach to solving the problem. -->\n\n# Complexity\n- Time complexity:\n<!-- Add your time complexity here, e.g. $$O(n)$$ -->\n\n- Space complexity:\n<!-- Add your space complexity here, e.g. $$O(n)$$ -->\n\n# Code\n```\nclass Solution {\n  int sumOfSquares(List<int> nums) {\n    int l = nums.length;\n    int sum = 0;\n    for(int i=1;i<=l;i++){\n        if(l%i==0){\n            sum = sum + (nums[i-1]*nums[i-1]);\n        }\n    }\n    return sum;\n  }\n}\n```
['Dart']