Pangram Checking
Submissions: 1025   Accuracy:

31.44%

  Difficulty: Easy   Marks: 2
Associated Course(s):   Geeks Classes in Noida

Given a string check if it is Pangram or not. A pangram is a sentence containing every letter in the English Alphabet.

Input:
First line of input contains of an integer 'T' denoting number od test cases then T test cases follow . Each testcase contains a String 'S'.

Output:
For each test case print in a new line 1 if its a pangram else print 0 .

Constraints:
1 <= T <= 25
1 <= |S| <= 50

Example:
Input:

2
Bawds jog flick quartz vex nymph
sdfs

Output:
1
0

Explanation:
Testcase 1:
The string contains all the letters of english alphabet.

** For More Input/Output Examples Use 'Expected Output' option **

Author: Shubham Joshi 1


If you have purchased any course from GeeksforGeeks then please ask your doubt on course discussion forum. You will get quick replies from GFG Moderators there.



Need help with your code? Please use ide.geeksforgeeks.org, generate link and share the link here.

to report an issue on this page.