Time: 5 ms (84.53%), Space: 65.9 MB (40.94%) - LeetHub

Author: Sangram03

3213-count-subarrays-where-max-element-appears-at-least-k-times/3213-count-subarrays-where-max-element-appears-at-least-k-times.java

@@ -0,0 +1,18 @@
+class Solution {
+    public long countSubarrays(int[] nums, int k) {
+        int maxi = Integer.MIN_VALUE;
+        for (int num : nums) maxi = Math.max(maxi, num);
+        int left = 0;
+        long maxiOccurence = 0;
+        long res = 0;
+        for (int right = 0; right < nums.length; right++) {
+            if (nums[right] == maxi) maxiOccurence++;
+            while (maxiOccurence >= k) {
+                if (nums[left] == maxi) maxiOccurence--;
+                left++;
+            }
+            res += left;
+        }
+        return res;
+    }
+}