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: function pangrams(s) {
        // write code here
        // do not console.log it
        // return 1 or 0
        let alphabet = "abcdefghijklmnopqrstuvwxyz";
        let regex = /\s/g;
        let lowercase = s.toLowerCase().replace(regex, "");
       
        for(let i = 0; i < alphabet.length; i++){
         if(lowercase.indexOf(alphabet[i]) === -1){
           return 0;
         }
        }
       
       return 1;
     }, In this Programming Language: JavaScript, Now tell me if this Code is compilable or not?