answer1and2.py

def isSubset(A,B):
	"""
	takes two arrays as input, each array contains a list of A-Z;
	return True if all the elements in 2nd array is also in 1st array, or False if not.
	"""
	for i in range(len(B)):
		found=False
		for j in range(len(A)): #check if each character of B is found in A
			if B[i] == A[j]:
				found=True
				break
		if(not found): return False #one character of B is not in A found
	return True #all character of B is in A
"""
Time Complexity: O(n^2)
2 loops
"""