LeetCode 2913: Subarrays Distinct Element Sum of Squares I | Java Solution

In this video, we solve LeetCode 2913 – Subarrays Distinct Element Sum of Squares I using Java. The goal is to calculate the sum of the squares of the number of distinct elements in every possible subarray. 📌 Problem Details 🔹 Problem: Subarrays Distinct Element Sum of Squares I 🔹 LeetCode: 2913 🔹 Language: Java 🔹 Approach: Nested Loops + HashSet 🔹 Time Complexity: O(n²) expected 🔹 Space Complexity: O(n) 🚀 What You’ll Learn How to generate all possible subarrays. How to count distinct elements using a HashSet. How to calculate the square of each distinct-element count. How to solve array problems using nested loops and sets. A great problem for practicing Arrays, Subarrays, HashSets, and Basic Mathematics. 👍 Like, comment, and subscribe for more LeetCode solutions, DSA tutorials, and Java coding problems! #LeetCode #Java #DSA #LeetCode2913 #Subarrays #HashSet #Arrays #CodingInterview #DSAInJava #ProblemSolving