Count Subarrays With Fixed Bounds
Try to solve the Count Subarrays With Fixed Bounds problem.
We'll cover the following...
We'll cover the following...
Statement
Given an integer array, nums
, and two integers minK
and maxK
, return the number of fixed-bound subarrays.
A subarray in nums
is called a fixed-bound subarray if it satisfies the following conditions:
The smallest value in the subarray equals
minK
.The largest value in the subarray equals
maxK
.
Note: A subarray is a contiguous sequence of elements within an array.
Constraints:
...