Pangram.cpp

#include <bits/stdc++.h>
using namespace std;

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';
		// If this character is other than english
		// lowercase and uppercase characters.
		else
			continue;
		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);
}

// Driver Program to test above functions
int main()
{
	string str = "The quick brown fox jumps over the"
				" lazy dog";
	if (checkPangram(str) == true)
		printf(" %s \nis a pangram", str.c_str());
	else
		printf(" %s \nis not a pangram", str.c_str());
	return (0);
}

// This code is contributed by Aditya kumar (adityakumar129)