Pangram Checking solution

 

Pangram Checking

Given a string check if it is Pangram or not. A pangram is a sentence containing every letter in the English Alphabet.

Example 1:

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.

Example 2:

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.

Your Task:
 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).

Constraints:
1 <= |S| <= 104

Solution

class Solution
{
    public static boolean checkPangram  (String str)
    {
        // your code here
        String s = str.replaceAll("\\p{Punct}","");
        s = s.toLowerCase();
        int[] ar = new int[26];
        for(int i=0;i<s.length();i++)
            if(s.charAt(i)!=' ')
                ar[(int)(s.charAt(i)-'a')]++;
            
        for(int i=0;i<26;i++) 
            if(ar[i]==0)
                return false;
        return true;        
    }
}