Union Two Sorted Arrays.cpp

//{ Driver Code Starts
#include <bits/stdc++.h>
using namespace std;


// } Driver Code Ends
class Solution{
    public:
    //arr1,arr2 : the arrays
    // n, m: size of arrays
    //Function to return a list containing the union of the two arrays. 
    vector<int> findUnion(int arr1[], int arr2[], int n, int m)
    {
        //Your code here
        //return vector with correct order of elements
         vector<int>solution;
        int j=0, i=0;
    while(i < n && j < m)
    {
        if(arr1[i] == arr2[j])
        {
            solution.push_back(arr1[i]);
            i++;
            j++;
        }
        else if(arr1[i] > arr2[j])
        {
            solution.push_back(arr2[j]);
            j++;
        }
        else
        {
            solution.push_back(arr1[i]);
            i++;
        }
    }
    
    while(i <n)
    {
        solution.push_back(arr1[i]);
        i++;
    }
    while(j<m)
    {
        solution.push_back(arr2[j]);
        j++;
    }
    
    sort(solution.begin(), solution.end());
    
    vector<int>::iterator itr;
    
    itr = unique(solution.begin(), solution.end());
    
    solution.resize(distance(solution.begin(), itr));
    return solution; 
}
};

//{ Driver Code Starts.

int main() {
	
	int T;
	cin >> T;
	
	while(T--){
	    
	    
	    
	    int N, M;
	    cin >>N >> M;
	    
	    int arr1[N];
	    int arr2[M];
	    
	    for(int i = 0;i<N;i++){
	        cin >> arr1[i];
	    }
	    
	    for(int i = 0;i<M;i++){
	        cin >> arr2[i];
	    }
	    Solution ob;
	    vector<int> ans = ob.findUnion(arr1,arr2, N, M);
	    for(int i: ans)cout<<i<<' ';
	    cout << endl;
	    
	}
	
	return 0;
}
// } Driver Code Ends