Leetcode 2444. Count Subarrays With Fixed Bounds

Count the number of contiguous subarrays whose minimum equals minK and maximum equals maxK. The main challenge is to efficiently (O(n)) scan the array, partitioning it by values outside [minK, maxK] and counting subarrays that include at least one minK and one maxK.