Add new Sliding Window Problems

Author: kiranpalsingh1806

README.md

@@ -439,6 +439,7 @@
 |8|[Permutation In String](https://leetcode.com/problems/permutation-in-string/)|Medium|[Solution](/solutions/sliding-window.md)|
 |9|[Minimum Window Substring](https://leetcode.com/problems/minimum-window-substring/)|Hard|[Solution](/solutions/sliding-window.md)|
 |10|[Substring With Concatenation Of All Words](https://leetcode.com/problems/substring-with-concatenation-of-all-words/)|Hard|[Solution](/solutions/sliding-window.md)|
+|11|[Count Subarrays With Fixed Count](https://leetcode.com/problems/count-subarrays-with-fixed-bounds/)|Hard|[Solution](/solutions/sliding-window/count-subarrays-with-fixed-count.md)|
 
 ## 32. Stack
 

solutions/sliding-window/count-subarrays-with-fixed-count.md

@@ -0,0 +1,14 @@
+## Count Subarrays With Fixed Count
+
+```cpp
+long long countSubarrays(vector<int>& A, int minK, int maxK) {
+    long res = 0, jbad = -1, jmin = -1, jmax = -1, n = A.size();
+    for (int i = 0; i < n; ++i) {
+        if (A[i] < minK || A[i] > maxK) jbad = i;
+        if (A[i] == minK) jmin = i;
+        if (A[i] == maxK) jmax = i;
+        res += max(0L, min(jmin, jmax) - jbad);
+    }
+    return res;
+}
+```