Pangram Checking
Easy Accuracy: 34.52% Submissions: 1570 Points: 2

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.

to report an issue on this page.

Editorial

We strongly recommend solving this problem on your own before viewing its editorial. Do you still want to view the editorial?

Yes

All Submissions

My Submissions:

Login to access your submissions.