Resolved 'Count Subarrays With Fixed Bounds' LeetCode problem with an optimized solution

Author: DevOgabek

Python/count_subarrays_with_fixed_bounds.py

@@ -0,0 +1,23 @@
+# Count Subarrays With Fixed Bounds
+
+class Solution(object):
+    def countSubarrays(self, nums, minK, maxK):
+        res = 0
+        bad_idx = left_idx = right_idx = -1
+
+        for i, num in enumerate(nums) :
+            if not mink <= num <= maxK:
+                bad_idx = i
+
+            if num == mink:
+                left_idx = i
+
+            if num == maxK:
+                right_idx = i
+
+            res += max(0, min(left_idx, right_idx) - bad_idx)
+
+        return res
+    
+solution = Solution()
+print(solution.countSubarrays([1,3,5,2,7,5], 1, 5))