Please enter your email address or userHandle.
Given a string check if it is Pangram or not. A pangram is a sentence containing every letter in the English Alphabet.
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'.
For each test case print in a new line 1 if its a pangram else print 0 .
1 <= T <= 25
1 <= |S| <= 50
Bawds jog flick quartz vex nymph
Testcase 1: The string contains all the letters of english alphabet.
We strongly recommend solving this problem on your own before viewing its editorial. Do you still want to view the editorial?
Login to access your submissions.
Please choose 'ReadOnlyMode' if you needn't to 'Edit' the problem e.g. viewing OJ's solution, TestCase Files (TCFs), TimeLimit etc.