Documentation Index
Fetch the complete documentation index at: /llms.txt
Use this file to discover all available pages before exploring further.
Tested Python solution for LeetCode 2962 with 18 pytest cases. Generate a practice environment with lcpy.
lcpy gen -n 2962 # by problem number
lcpy gen -s count_subarrays_where_max_element_appears_at_least_k_times # by problem name
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.
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].
Input: nums = [1,4,2,1], k = 3
Output: 0
Explanation: No subarray contains the element 4 at least 3 times.
class Solution:
# Time: O(n)
# Space: O(1)
def count_subarrays(self, nums: list[int], k: int) -> int:
mx = max(nums)
total = 0
count = 0
left = 0
for value in nums:
if value == mx:
count += 1
while count >= k:
if nums[left] == mx:
count -= 1
left += 1
total += left
return total
| Time | Space |
|---|---|
| O(n) | O(1) |