Added Zero Sum SubArray simple and effective solution

Author: Piyush-Karira

Zero_Sum_SubArray/question.txt

@@ -0,0 +1,4 @@
+Given an Array of size N, identify whether there exists a subarray with zero sum?
+
+Conditions: -10^6<=N<=10^6
+Time limit is 1.0 sec

Zero_Sum_SubArray/solution.cpp

@@ -0,0 +1,37 @@
+/* C++ Solution */
+
+#include <bits/stdc++.h>
+using namespace std;
+
+/*Function to check whether zero sum subarray exists or not*/
+bool hasZeroSum(int arr[], int N)
+{
+    set<int> st;
+    int sum=0;
+    for(int i=0;i<N;i++)
+    {
+        sum+=arr[i];
+        /*if Set contains a sum already,
+        that means zero sum subArray exists*/
+        if(st.find(sum)!=st.end()||sum==0)
+        return true;
+        
+        st.insert(sum);
+    }
+    return false;
+}
+
+int main() {
+	int N;
+	cin>>N;
+	int arr[N+1];
+	
+	//Array input
+	for(int i=0;i<N;i++)
+	    cin>>arr[i];
+	
+	
+	bool ans = hasZeroSum(arr,N);
+	cout<<ans;
+	return 0;
+}