Merge pull request ashutosh97#79 from Piyush-Karira/master

Added Zero Sum SubArray simple and effective solution

Author: ashutosh97

Merging_Two_Sorted_Array/question.txt

@@ -0,0 +1 @@
+Given two sorted arrays arr1[] and arr2[] in non-decreasing order with size n and m. The task is to merge the two sorted arrays into one sorted array (in non-decreasing order)

Merging_Two_Sorted_Array/solution.cpp

@@ -0,0 +1,54 @@
+#include<bits/stdc++.h>
+using namespace std;
+int main()
+ {
+	int t;
+	cin>>t;
+	while(t--)
+	{
+	    int x,y;
+	    cin>>x>>y;
+	    long a[x+1],b[y+1];
+	    for(int i=0;i<x;i++)
+	    cin>>a[i];
+	    for(int i=0;i<y;i++)
+	    cin>>b[i];
+	    
+	    int i=0,j=0;
+	    vector<long> vec;
+	    while(i<x&&j<y)
+	    {
+	        if(a[i]<b[j])
+	        {
+	            vec.push_back(a[i]);
+	            i++;
+	        }
+	        else if(a[i]>b[j])
+	        {
+	            vec.push_back(b[j]);
+	            j++;
+	        }
+	        else if(a[i]==b[j])
+	        {
+	            vec.push_back(a[i]);
+	            vec.push_back(b[j]);
+	            i++;
+	            j++;
+	        }
+        }
+        while(i<x)
+        {
+            vec.push_back(a[i]);
+            i++;
+        }
+        while(j<y){
+            vec.push_back(b[j]);
+            j++;
+        }
+        for(int i=0;i<vec.size();i++)
+        cout<<vec[i]<<" ";
+        
+        cout<<endl;
+	}
+	return 0;
+}

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;
+}