Given a string check if it is Pangram or not. A pangram is a sentence containing every letter in the English Alphabet.
Input: S = Bawds jog, flick quartz, vex nymph Output: 1 Explantion: In the given input, there are all the letters of the English alphabet. Hence, the output is 1.
Input: S = sdfs Output: 0 Explantion: In the given input, there aren't all the letters present in the English alphabet. Hence, the output is 0.
You need to complete the function checkPangram() that takes a string as a parameter and returns true if the string is a pangram, else it returns false.
Expected Time Complexity: O(N).
Expected Auxiliary Space: O(Number of distinct characters).
1 <= |S| <= 104
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.