From 3a60ca7c37380baa369cf6fe83f6955b075cb65d Mon Sep 17 00:00:00 2001
From: chayan das <dasshuvo817@gmail.com>
Date: Sat, 10 May 2025 21:05:39 +0530
Subject: [PATCH] Create 10 May  Longest Subarray with Majority Greater than K

---
 ...gest Subarray with Majority Greater than K | 33 +++++++++++++++++++
 1 file changed, 33 insertions(+)
 create mode 100644 10 May  Longest Subarray with Majority Greater than K

diff --git a/10 May  Longest Subarray with Majority Greater than K b/10 May  Longest Subarray with Majority Greater than K
new file mode 100644
index 0000000..23efcc5
--- /dev/null
+++ b/10 May  Longest Subarray with Majority Greater than K	
@@ -0,0 +1,33 @@
+class Solution {
+  public:
+    int longestSubarray(vector<int> &arr, int k) {
+        int n=arr.size();
+        vector<int>diff(n);
+        for(int i=0;i<n;i++){
+            if(arr[i]>k){
+                diff[i]=1;
+            }
+            else{
+                diff[i]=-1;
+            }
+        }
+        unordered_map<int,int>mp;
+        int prefix=0;
+        int maxlen=0;
+        for(int i=0;i<n;i++){
+            prefix+=diff[i];
+            if(prefix>0){
+                maxlen=i+1;
+            }
+            else{
+                if(mp.find(prefix-1)!=mp.end()){
+                    maxlen=max(maxlen,i-mp[prefix-1]);
+                }
+            }
+            if(mp.find(prefix)==mp.end()){
+                mp[prefix]=i;
+            }
+        }
+        return maxlen;
+    }
+};