Intersection Of Two Sorted Arrays.cpp

#include <bits/stdc++.h> 
vector<int> findArrayIntersection(vector<int> &arr1, int n, vector<int> &arr2, int m)
{
	int i=0;
	int j=0;
	vector<int> ans;
	while(i<n && j<m){
		if(arr1[i]<arr2[j])
		i++;
		else if(arr2[j]<arr1[i])
		j++;
		else{
			ans.push_back(arr1[i]);
			i++;
			j++;
		}
	}

	return ans;
}