Count-subarrays-with-fixed-bounds.java

class Solution {
    public long countSubarrays(int[] nums, int minK, int maxK) {
        int minI = -1, maxI = -1, LB = -1, N = nums.length;
        long res = 0;
      
        for(int cur = 0; cur < N; cur++){
            if(nums[cur] == minK){
                minI = cur;
            }
          
            if(nums[cur] == maxK){
                maxI = cur;
            }
          
            // Check for "Out of Bounds"
          
            if(nums[cur] < minK || nums[cur] > maxK){
                LB = cur;
            }
          
            if(minI != -1 && maxI != -1){
                int small = Math.min(minI, maxI);
              
                if((small - LB) > 0){
                    res += small - LB; 
                }
            }
        }
      
        return res;
    }
}