DSA problem
Count Subarrays With Fixed Bounds
You are given an integer array nums and two integers minK and maxK.
A fixed-bound subarray of nums is a subarray that satisfies both of the following conditions:
- The minimum value in the subarray is exactly equal to
minK. - The maximum value in the subarray is exactly equal to
maxK.
Return the number of fixed-bound subarrays.
A subarray is a contiguous part of an array.
Examples
Example 1
Input:
nums = [1,3,5,2,7,5], minK = 1, maxK = 5Output:
2Explanation: The fixed-bound subarrays are [1,3,5] and [1,3,5,2].
Example 2
Input:
nums = [1,1,1,1], minK = 1, maxK = 1Output:
10Explanation: Every subarray of nums is a fixed-bound subarray. There are 10 such subarrays.
Example 3
Input:
nums = [4,2,7,3], minK = 2, maxK = 7Output:
1Explanation: Only the subarray [2,7] has minimum 2 and maximum 7.
Constraints
- 2 <= nums.length <= 10^5
- 1 <= nums[i], minK, maxK <= 10^6
3 hints and a full solution walkthrough with step-by-step visualizations are available in the practice editor.