I'm trying to find if a string is a Pangram. My approach is to get the string to have unique letters by using the set method. Then using the string.ascii as the base alphabet. I find out after some testing that if I try to compare the 2 with the 'in' operator. Some of the letters get passed over and won't be removed from the alphabet list.
def is_pangram(sentence):
    uniqueLetters = set(sentence.lower().replace(" ", ""))
    alphabet = list(string.ascii_lowercase)
    for letter in alphabet:
      if letter in uniqueLetters:
        alphabet.remove(letter)
    if len(alphabet) <= 0:
      return True
    return False
print(is_pangram("qwertyuiopasdfghjklzxcvbnm"))
this example will compare 13 letters and the rest will not. Anyone can point me in the right direction? Am I misunderstanding something about set?
 
    