Apr 24

Author: siddydutta

2025-04-April-LeetCoding-Challenge/Count Complete Subarrays in an Array.py

@@ -0,0 +1,25 @@
+class Solution:
+    def countCompleteSubarrays(self, nums: list[int]) -> int:
+        n, distinct = len(nums), len(set(nums))
+        ptr1, freqs, count = 0, {}, 0
+        for ptr2 in range(n):
+            freqs[nums[ptr2]] = freqs.get(nums[ptr2], 0) + 1
+            while len(freqs) == distinct:
+                count += n - ptr2
+                freqs[nums[ptr1]] -= 1
+                if freqs[nums[ptr1]] == 0:
+                    del freqs[nums[ptr1]]
+                ptr1 += 1
+        return count
+
+
+def main():
+    nums = [1, 3, 1, 2, 2]
+    assert Solution().countCompleteSubarrays(nums) == 4
+
+    nums = [5, 5, 5, 5]
+    assert Solution().countCompleteSubarrays(nums) == 10
+
+
+if __name__ == '__main__':
+    main()

2025-04-April-LeetCoding-Challenge/README.md

@@ -27,7 +27,7 @@
 | April 21 | [2145. Count the Hidden Sequences](https://leetcode.com/problems/count-the-hidden-sequences/) | Medium | Solved |
 | April 22 | [2338. Count the Number of Ideal Arrays](https://leetcode.com/problems/count-the-number-of-ideal-arrays/) | Hard | Unsolved |
 | April 23 | [1399. Count Largest Group](https://leetcode.com/problems/count-largest-group/) | Easy | Solved |
-| April 24 | []() |  |  |
+| April 24 | [2799. Count Complete Subarrays in an Array](https://leetcode.com/problems/count-complete-subarrays-in-an-array/) | Medium | Solved |
 | April 25 | []() |  |  |
 | April 26 | []() |  |  |
 | April 27 | []() |  |  |
@@ -40,5 +40,5 @@
 | Level  | Problems | Solved | Unsolved |
 | ---    | --- | --- | --- |
 | Easy   | 7 | 7 | 0 |
-| Medium | 12 | 9 | 3 |
+| Medium | 13 | 10 | 3 |
 | Hard   | 4 | 0 | 4 |