Count Subarrays Where Max Element Appears at Least K Times
Medium
You receive an integer array nums and a positive integer k.
Find and provide the count of subarrays where the largest element of nums appears at least k times in that subarray.
A subarray is a contiguous sequence of elements within an array.
Example 1
Input: nums = [1,3,2,3,3], k = 2
Output: 6
Explanation: The subarrays that contain the element 3 at least 2 times are: [1,3,2,3], [1,3,2,3,3], [3,2,3], [3,2,3,3], [2,3,3] and [3,3].
Example 2
Input: nums = [1,4,2,1], k = 3
Output: 0
Explanation: No subarray includes the element 4 at least 3 times.
Constraints
1 <= nums.length <= 10^51 <= nums[i] <= 10^61 <= k <= 10^5
Did this problem appear in one of your interviews?
Responses stay private.