Pangram

Level EASY

A word or a sentence is called a pangram if all the characters of this language appear in it at least once. You are given a string s consisting of lowercase and uppercase Latin letters. Check whether this string is a pangram. Print "YES" or "NO".

We say that the string contains a letter of the Latin alphabet, if this letter occurs in the string in either uppercase or in lowercase.

Input format :
Line 1 : n (Number of characters in string)
Line 2 : Input string s
Output format :
YES or NO
Constraints :

1 <= n <= 100

Sample Input 1 :
12
toosmallword
Sample Output 1 :
NO
Sample Input 2 :
35
TheQuickBrownFoxJumpsOverTheLazyDog
Sample Output 2 :
YES
num=int(input())
s=[char for char in input()]
l=[]
for i in range(0,num):
if l.count(s[i].lower()) == 1:
continue
else:l.append(s[i].lower())
if len(l)==26:
print("YES")
else:print("NO")
view raw Pangram.py hosted with ❤ by GitHub

Comments

Popular posts from this blog

MySQL Multi Source Master Slave Replication using GTID

Access and modify all the resources of our Wiki.js using WikiJS API

How to setup an Nginx reverse proxy with a SSL certificate in XWIKI