We use cookies to ensure you have the best browsing experience on our website. Please read our cookie policy for more information about how we use cookies.
lo = s.lower()
count = []
sl = ["a","b","c","d","e","f","g","h","i","j","k","l",
"m","n","o","p","q","r","s","t","u","v","w","x","y","z"]
for i in lo:
if i in sl:
count.append(i)
n = set(count)
print(n)
if len(n) == 26:
return('pangram')
else:
return('not pangram')
Cookie support is required to access HackerRank
Seems like cookies are disabled on this browser, please enable them to open this website
Pangrams
You are viewing a single comment's thread. Return to all comments →
def pangrams(s):