Oursky Developer Pre-test

Answer1.cpp

// Write a function that takes two arrays as input, each array contains a list of A-Z; Your program
// should return True if the 2nd array is a subset of 1st array, or False if not.
// For example:
// isSubset([A,B,C,D,E], [A,E,D]) = true
// isSubset([A,B,C,D,E], [A,D,Z]) = false
// isSubset([A,D,E], [A,A,D,E]) = true

bool isSubset(vector<int> &arr1, vector<int> &arr2) {
	map<int,bool> m;
  
	for(int i=0; i<arr1.size(); i++) {
		m[arr1[i]] = true;
	}
  
	for(int i=0; i<arr2.size(); i++) {
		if(!m[arr2[i]])
		  return false;
	}
  /* If we reach here then all elements of arr2 
  // are present in arr1 */
	return true;
}