Time: 8 ms (54.6%), Space: 59.9 MB (92.58%) - LeetHub

Author: Sangram03

2527-count-subarrays-with-fixed-bounds/2527-count-subarrays-with-fixed-bounds.java

@@ -0,0 +1,15 @@
+class Solution {
+    public long countSubarrays(int[] nums, int minK, int maxK) {
+        long res = 0;
+        int bad = -1, left = -1, right = -1;
+
+        for (int i = 0; i < nums.length; i++) {
+            if (nums[i] < minK || nums[i] > maxK) bad = i;
+            if (nums[i] == minK) left = i;
+            if (nums[i] == maxK) right = i;
+            res += Math.max(0, Math.min(left, right) - bad);
+        }
+
+        return res;
+    }
+}