Add solution #2962

Author: JoshCrozier

README.md

@@ -1,4 +1,4 @@
-# 1,515 LeetCode solutions in JavaScript
+# 1,516 LeetCode solutions in JavaScript
 
 [https://leetcodejavascript.com](https://leetcodejavascript.com)
 
@@ -1493,6 +1493,7 @@
 2873|[Maximum Value of an Ordered Triplet I](./solutions/2873-maximum-value-of-an-ordered-triplet-i.js)|Easy|
 2874|[Maximum Value of an Ordered Triplet II](./solutions/2874-maximum-value-of-an-ordered-triplet-ii.js)|Medium|
 2948|[Make Lexicographically Smallest Array by Swapping Elements](./solutions/2948-make-lexicographically-smallest-array-by-swapping-elements.js)|Medium|
+2962|[Count Subarrays Where Max Element Appears at Least K Times](./solutions/2962-count-subarrays-where-max-element-appears-at-least-k-times.js)|Medium|
 2965|[Find Missing and Repeated Values](./solutions/2965-find-missing-and-repeated-values.js)|Easy|
 2999|[Count the Number of Powerful Integers](./solutions/2999-count-the-number-of-powerful-integers.js)|Hard|
 3042|[Count Prefix and Suffix Pairs I](./solutions/3042-count-prefix-and-suffix-pairs-i.js)|Easy|

solutions/2962-count-subarrays-where-max-element-appears-at-least-k-times.js

@@ -0,0 +1,35 @@
+/**
+ * 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/
+ * Difficulty: Medium
+ *
+ * You are given an integer array nums and a positive integer k.
+ *
+ * Return the number of subarrays where the maximum element of nums appears at least k times in
+ * that subarray.
+ *
+ * A subarray is a contiguous sequence of elements within an array.
+ */
+
+/**
+ * @param {number[]} nums
+ * @param {number} k
+ * @return {number}
+ */
+var countSubarrays = function(nums, k) {
+  const maxNum = Math.max(...nums);
+  let maxCount = 0;
+  let left = 0;
+  let result = 0;
+
+  for (let right = 0; right < nums.length; right++) {
+    if (nums[right] === maxNum) maxCount++;
+    while (maxCount >= k) {
+      result += nums.length - right;
+      if (nums[left] === maxNum) maxCount--;
+      left++;
+    }
+  }
+
+  return result;
+};