31-03-2024

importlogic · importlogic · commit de7c45df4dd6 · 2024-03-31T21:36:11.000+05:30
diff --git a/2024/03 - March/31-03-2024.cpp b/2024/03 - March/31-03-2024.cpp
@@ -0,0 +1,31 @@
+/*
+
+Author : Manas Rawat 
+Date : 31/03/2024
+Problem : Count Subarrays With Fixed Bounds
+Difficulty : Hard 
+Problem Link : https://leetcode.com/problems/count-subarrays-with-fixed-bounds/description/
+Video Solution : NA
+
+*/
+
+
+class Solution {
+public:
+    long long countSubarrays(vector<int>& nums, int minK, int maxK) {
+        long long ans=0;
+        int maxi=-1, mini=-1;
+        int s=nums.size();
+        for(int r=0, l=0; r<s; r++){
+            int x=nums[r];
+            if (x<minK ||x>maxK){
+                l=r+1;
+                continue;
+            }
+            if (x==maxK) maxi=r;
+            if (x==minK) mini=r; 
+            ans+=max((min(maxi, mini)-l+1),0);
+        }
+        return ans;        
+    }
+};
