For this Question: Given a string S check if it is Pangram or not. A pangram is a sentence containing all 26 letters of 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.

Constraints:
1 <= T <= 100
1 <= |S| <= 1000

Note:- String will not contain any spacesFor each test case print in a new line 1 if its a pangram else print 0.Input:
2
Bawdsjogflickquartzvenymph
sdfs

Output:
0
0

Explanation :
Testcase 1: In the given input, the letter 'x' of the english alphabet is not present. Hence, the output is 0.
Testcase 2: In the given input, there aren't all the letters present in the english alphabet. Hence, the output is 0., I have written this Solution Code: def ispangram(str):
    alphabet = "abcdefghijklmnopqrstuvwxyz"
    for char in alphabet:
        if char not in str.lower():
            return False
  
    return True

N = int(input())
arr = []
for i in range(N):
    arr.append(input())

for i in range(N):
    if(ispangram(arr[i]) == True):
        print(1)
    else:
        print(0), In this Programming Language: Python, Now tell me if this Code is compilable or not?