diff --git a/2962. Count Subarrays Where Max Element Appears at Least K Times1 b/2962. Count Subarrays Where Max Element Appears at Least K Times1
new file mode 100644
index 0000000..5d24bd1
--- /dev/null
+++ b/2962. Count Subarrays Where Max Element Appears at Least K Times1	
@@ -0,0 +1,18 @@
+class Solution {
+public:
+    long long countSubarrays(vector<int>& nums, int k) {
+        
+        int mx=*max_element(begin(nums),end(nums));
+        long long ans=0;
+        
+        int l=0,r=0,n=size(nums);
+        while(r<n){
+            k-=(nums[r++]==mx);
+            while(k==0){
+                k+=(nums[l++]==mx);
+            }
+            ans+=l;
+        }
+        return ans;
+    }
+};