add 2962

Author: Ashwagandha-coder

contest/src/main/java/com/github/contest/Execute.kt

@@ -3,9 +3,10 @@ package com.github.contest
 
 import com.github.contest.hashTable.countGoodAlternativeSolution
 import com.github.contest.math.numberOfPowerfulInt
+import com.github.contest.slidingWindow.countSubArrayWithMaxElement
+import com.github.contest.slidingWindow.countSubArrays
 import com.github.contest.strings.fullJustify
 import com.github.contest.strings.subStrHash
-import com.github.contest.twoPointer.trap
 import java.util.TreeMap
 
 
@@ -15,7 +16,9 @@ import java.util.TreeMap
 
 fun main() {
 
-    trap(intArrayOf(5, 1, 6, 2, 1, 2, 1, 3)).also { println(it) }
+    countSubArrayWithMaxElement(
+        intArrayOf(1, 3, 2, 3, 3), 2
+    ).also { println(it) }
 
 
 }

contest/src/main/java/com/github/contest/slidingWindow/SlidingWindowLeetcode.kt

@@ -133,3 +133,31 @@ private fun equalsMap(comparable: Map<String, Int>, base: Map<String, Int>): Boo
 
     return true
 }
+
+/**
+ * 2962. Count Subarrays Where Max Element Appears at Least K Times
+ */
+
+fun countSubArrayWithMaxElement(nums: IntArray, k: Int): Long {
+    val maxNum = nums.maxOrNull() ?: return 0
+    var count = 0L
+    var left = 0
+    var maxCount = 0
+
+    for (right in nums.indices) {
+        if (nums[right] == maxNum) {
+            maxCount++
+        }
+
+        // When we have at least k occurrences, we count all subarrays ending at right
+        while (maxCount >= k) {
+            count += nums.size - right
+            if (nums[left] == maxNum) {
+                maxCount--
+            }
+            left++
+        }
+    }
+
+    return count
+}