Create Largest Subarray with Sum X

dorakit#15 Issue resolved

Largest Subarray with Sum X

@@ -0,0 +1,27 @@
+#include<bits/stdc++.h>
+using namespace std;
+int largestSubarrayWithSumX(int arr[],int n,int x)
+{
+    int prefix_sum=0;
+    int res=0;
+    unordered_map<int,int>mp;
+    for(int i=0;i<n;i++)
+    {
+        prefix_sum+=arr[i];
+        if (prefix_sum==x)
+            res=i+1;
+        if(mp.find(prefix_sum)==mp.end())
+            mp.insert({prefix_sum,i});
+        if(mp.find(prefix_sum-x)!=mp.end())
+                res=max(res,(i-mp[prefix_sum-x]));
+    }
+    return res;
+}
+int main()
+{
+    int arr[] = {8, 3, -7, -4, 1};
+    int n = sizeof(arr)/sizeof(arr[0]);
+    int sum = -10;
+
+    cout << largestSubarrayWithSumX(arr, n, sum);
+}