Apr 29

Author: siddydutta

2025-04-April-LeetCoding-Challenge/Count Subarrays Where Max Element Appears at Least K Times.py

@@ -0,0 +1,25 @@
+class Solution:
+    def countSubarrays(self, nums: list[int], k: int) -> int:
+        max_ = max(nums)
+        ptr1, curr, count = 0, 0, 0
+        for ptr2 in range(len(nums)):
+            curr += nums[ptr2] == max_
+            while curr >= k:
+                curr -= nums[ptr1] == max_
+                ptr1 += 1
+            count += ptr1
+        return count
+
+
+def main():
+    nums = [1, 3, 2, 3, 3]
+    k = 2
+    assert Solution().countSubarrays(nums, k) == 6
+
+    nums = [1, 4, 2, 1]
+    k = 3
+    assert Solution().countSubarrays(nums, k) == 0
+
+
+if __name__ == '__main__':
+    main()

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

@@ -32,13 +32,13 @@
 | April 26 | [2444. Count Subarrays With Fixed Bounds](https://leetcode.com/problems/count-subarrays-with-fixed-bounds/) | Hard | Unsolved |
 | April 27 | [3392. Count Subarrays of Length Three With a Condition](https://leetcode.com/problems/count-subarrays-of-length-three-with-a-condition/) | Easy | Solved |
 | April 28 | [2302. Count Subarrays With Score Less Than K](https://leetcode.com/problems/count-subarrays-with-score-less-than-k/) | Hard | Solved |
-| April 29 | []() |  |  |
+| April 29 | [2962. Count Subarrays Where Max Element Appears at Least K Times](https://leetcode.com/problems/count-subarrays-where-max-element-appears-at-least-k-times/) | Medium | Solved |
 | April 30 | []() |  |  |
 
 
 ## Summary
 | Level  | Problems | Solved | Unsolved |
 | ---    | --- | --- | --- |
 | Easy   | 8 | 8 | 0 |
-| Medium | 13 | 9 | 4 |
+| Medium | 14 | 10 | 4 |
 | Hard   | 6 | 1 | 5 |