leetcode 2913. Subarrays Distinct Element Sum of Squares I

https://leetcode.com/problems/subarrays-distinct-element-sum-of-squares-i/description/

Subarrays Distinct Element Sum of Squares I - LeetCode

 

class Solution:
    def sumCounts(self, nums: List[int]) -> int:
        answer = 0
        cnt = 1
        for i in range(len(nums), 0, -1):
            for j in range(i):
                distinct_nums = list(set(nums[j: j + cnt]))
                answer += (len(distinct_nums) ** 2)
            cnt += 1
        
        return answer