brotherko

## answer1.py
"""
list to Set: O(n)
Check if b in a: O(len(b))

so the the time complexity will be O(2n + len(b)) : O(n)

"""
class Solution:
  def isSubset(self, a, b):
    return set(b).issubset(set(a))

## init.coffee
test
	"""
	list to Set: O(n)
	Check if b in a: O(len(b))

	so the the time complexity will be O(2n + len(b)) : O(n)

	"""
	class Solution:
	def isSubset(self, a, b):
	return set(b).issubset(set(a))