Pangram.java

/* Problem Description
===============================================================================================
Given the input string find out whether the string is pangram or not.

Note: a string is said to be pangram if it contains all the alphabets from 'a' to 'z'.

Constraints
-------------------------
1<= length <= 100000

Input
--------------------------
There is only one line in the input string.

Output
---------------------------
Yes if its pangram. No if not a pangram.

Time Limit
--------------------------
1

Explanation
================================================================================================
Example 1

Input
-------------------------
The quick brown fox jumps over the lazy dog

Output
----------------------
Yes

Explanation:
----------------------------
It contains all characters from 'a' to 'z'.

 */
import java.util.*;
public class Pangram 
{
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        String s = sc.nextLine().toUpperCase();
        boolean ans = PangramCheck(s);
        if(ans==true)
        {
            System.out.println("Yes");
        }
        else
        {
            System.out.println("No");
        }
    }  
    public static boolean PangramCheck(String s)
    {
        int[] ascii = new int[26];

        for (int i = 0; i < ascii.length; i++) {
            ascii[i] = 0;
        }
        for (int i = 0; i < s.length(); i++) 
        {
            char a = 'A'; char z = 'Z';
            if(s.charAt(i)>=a && s.charAt(i)<=z)
            {
                ascii[(int)s.charAt(i)-65]++;
            }
        }
        for (int i = 0; i < ascii.length; i++) {
            if(ascii[i]==0)
            {
                return false;
            }
        }
        return true;
    }  
}