Pangram Checking - GeeksforGeeks

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

bool checkPangram (string &str)

{

    // Create a hash table to mark the characters

    // present in the string

    vector<bool> mark(26, false);

 

    // For indexing in mark[]

    int index;

 

    // Traverse all characters

    for (int i=0; i<str.length(); i++)

    {

        // If uppercase character, subtract 'A'

        // to find index.

        if ('A' <= str[i] && str[i] <= 'Z')

            index = str[i] - 'A';

 

        // If lowercase character, subtract 'a'

        // to find index.

        else if('a' <= str[i] && str[i] <= 'z')

            index = str[i] - 'a';

 

        // Mark current character

        mark[index] = true;

    }

 

    // Return false if any character is unmarked

    for (int i=0; i<=25; i++)

        if (mark[i] == false)

            return (false);

 

    // If all characters were present

    return (true);

}

Read full article from Pangram Checking - GeeksforGeeks