leetcode subarrays distinct element sum of squares

ferhatelmas · Nov 14, 2023 · 51445b7 · 51445b7
1 parent 74e8c9b
commit 51445b7
Showing 1 changed file with 11 additions and 0 deletions.
diff --git a/leetcode/algorithms/easy/subarrays_distinct_element_sum_of_squares.py b/leetcode/algorithms/easy/subarrays_distinct_element_sum_of_squares.py
@@ -0,0 +1,11 @@
+from typing import List
+
+
+class Solution:
+    def sumCounts(self, nums: List[int]) -> int:
+        s, l = 0, len(nums)
+        for i in range(1, l + 1):
+            for j in range(0, l - i + 1):
+                n = len(set(nums[j : j + i]))
+                s += n * n
+        return s