add 2913

Author: fishercoder1534

paginated_contents/algorithms/3rd_thousand/README.md

@@ -6,6 +6,7 @@
 | 2965 | [Find Missing and Repeated Values](https://leetcode.com/problems/find-missing-and-repeated-values/)                                                                                                             | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/thirdthousand/_2965.java)                                       |                                      | Easy                                     |
 | 2942 | [Find Words Containing Character](https://leetcode.com/problems/find-words-containing-character/)                                                                                                             | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/thirdthousand/_2942.java)                                       |                                      | Easy                                     |
 | 2937 | [Make Three Strings Equal](https://leetcode.com/problems/make-three-strings-equal/)                                                                                                             | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/thirdthousand/_2937.java)                                       |                                      | Easy                                     |
+| 2913 | [Subarrays Distinct Element Sum of Squares I](https://leetcode.com/problems/subarrays-distinct-element-sum-of-squares-i/)                                                                                                             | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/thirdthousand/_2913.java)                                       |                                      | Easy                                     |
 | 2908 | [Minimum Sum of Mountain Triplets I](https://leetcode.com/problems/minimum-sum-of-mountain-triplets-i/)                                                                                                             | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/thirdthousand/_2908.java)                                       |                                      | Easy                                     |
 | 2903 | [Find Indices With Index and Value Difference I](https://leetcode.com/problems/find-indices-with-index-and-value-difference-i/)                                                                                                             | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/thirdthousand/_2903.java)                                       |                                      | Easy                                     |
 | 2900 | [Longest Unequal Adjacent Groups Subsequence I](https://leetcode.com/problems/longest-unequal-adjacent-groups-subsequence-i/)                                                                                                             | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/thirdthousand/_2900.java)                                       |                                      | Easy                                     |

src/main/java/com/fishercoder/solutions/thirdthousand/_2913.java

@@ -0,0 +1,29 @@
+package com.fishercoder.solutions.thirdthousand;
+
+import java.util.HashSet;
+import java.util.List;
+import java.util.Set;
+
+public class _2913 {
+    public static class Solution1 {
+        public int sumCounts(List<Integer> nums) {
+            int ans = 0;
+            int subArraySize = 1;
+            while (subArraySize <= nums.size()) {
+                for (int i = 0; i < nums.size(); i++) {
+                    Set<Integer> set = new HashSet<>();
+                    set.add(nums.get(i));
+                    int j = i + 1;
+                    for (; j < Math.min(i + subArraySize, nums.size()); j++) {
+                        set.add(nums.get(j));
+                    }
+                    if (j - i == subArraySize) {
+                        ans += set.size() * set.size();
+                    }
+                }
+                subArraySize++;
+            }
+            return ans;
+        }
+    }
+}

src/test/java/com/fishercoder/thirdthousand/_2913Test.java

@@ -0,0 +1,24 @@
+package com.fishercoder.thirdthousand;
+
+import com.fishercoder.solutions.thirdthousand._2913;
+import org.junit.jupiter.api.BeforeEach;
+import org.junit.jupiter.api.Test;
+
+import java.util.Arrays;
+
+import static org.junit.jupiter.api.Assertions.assertEquals;
+
+public class _2913Test {
+    private static _2913.Solution1 solution1;
+
+    @BeforeEach
+    public void setup() {
+        solution1 = new _2913.Solution1();
+    }
+
+    @Test
+    public void test1() {
+        assertEquals(15, solution1.sumCounts(Arrays.asList(1, 2, 1)));
+    }
+
+}