Given an integer array nums and two integers left and right, return the number of contiguous non empty subarrays where the maximum element is greater than or equal to left and less than or equal to right.

Constraints:

• $1 \leq$ nums.length $\leq 10^5$

• $0 \leq$ nums[i] $\leq 10^9$

• $0 \leq$ left $\leq$ right $\leq 10^9$

Now, let’s take a moment to make sure you’ve correctly understood the problem. The quiz below helps you check if you’re solving the correct problem:

We have a game for you to play. Rearrange the logical building blocks to develop a clearer understanding of how to solve this problem.

Implement your solution in the following coding playground.