Apr 16

Author: siddydutta

2025-04-April-LeetCoding-Challenge/Count the Number of Good Subarrays.py

@@ -0,0 +1,27 @@
+class Solution:
+    def countGood(self, nums: list[int], k: int) -> int:
+        freq = dict()
+        ptr, count, result = 0, 0, 0
+        for num in nums:
+            count += freq.get(num, 0)
+            freq[num] = freq.get(num, 0) + 1
+            while count >= k:
+                freq[nums[ptr]] -= 1
+                count -= freq[nums[ptr]]
+                ptr += 1
+            result += ptr
+        return result
+
+
+def main():
+    nums = [1, 1, 1, 1, 1]
+    k = 10
+    assert Solution().countGood(nums, k) == 1
+
+    nums = [3, 1, 4, 3, 2, 2, 4]
+    k = 2
+    assert Solution().countGood(nums, k) == 4
+
+
+if __name__ == '__main__':
+    main()

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

@@ -19,7 +19,7 @@
 | April 13 | [1922. Count Good Numbers](https://leetcode.com/problems/count-good-numbers/) | Medium | Unsolved |
 | April 14 | [1534. Count Good Triplets](https://leetcode.com/problems/count-good-triplets/) | Easy | Solved |
 | April 15 | [2179. Count Good Triplets in an Array](https://leetcode.com/problems/count-good-triplets-in-an-array/) | Hard | Unsolved |
-| April 16 | []() |  |  |
+| April 16 | [2537. Count the Number of Good Subarrays](https://leetcode.com/problems/count-the-number-of-good-subarrays/) | Medium | Unsolved |
 | April 17 | []() |  |  |
 | April 18 | []() |  |  |
 | April 19 | []() |  |  |
@@ -40,5 +40,5 @@
 | Level  | Problems | Solved | Unsolved |
 | ---    | --- | --- | --- |
 | Easy   | 5 | 5 | 0 |
-| Medium | 7 | 5 | 2 |
+| Medium | 8 | 5 | 3 |
 | Hard   | 3 | 0 | 3 |