Leetcode Problem 795. Number of Subarrays with Bounded Maximum

795. Number of Subarrays with Bounded Maximum

Leetcode Solutions

Initialize count to 0, which will hold the final result.
Define a helper function countSubarrays that takes a bound B and returns the number of subarrays with all elements less than or equal to B.
In countSubarrays, initialize cur to 0, which tracks the number of valid subarrays ending at the current position.
Iterate through the array, incrementing cur when an element is less than or equal to B, and resetting cur to 0 when an element is greater than B.
Add cur to count for each iteration, accumulating the number of valid subarrays.
The final answer is countSubarrays(right) - countSubarrays(left - 1).

Programming Language

Purpose:

General Question

Debug My Code

image/screenshot of info(optional)

Full Screen