check-if-the-sentence-is-pangram.cpp

//question//


A pangram is a sentence where every letter of the English alphabet appears at least once.
Given a string sentence containing only lowercase English letters, return true if sentence is a pangram, or false otherwise.

 

Example 1:

Input: sentence = "thequickbrownfoxjumpsoverthelazydog"
Output: true
Explanation: sentence contains at least one of every letter of the English alphabet.
Example 2:

Input: sentence = "leetcode"
Output: false
 

Constraints:

1 <= sentence.length <= 1000
sentence consists of lowercase English letters.


//solution//


class Solution {
public:
    bool checkIfPangram(string sentence) {
        vector<int> v;
        for(int i=0;i<26;i++)
        {
            v.push_back(0);
        }
        if(sentence.size()<26)
        {
            return false;
        }
        for(int i=0;i<sentence.size();i++)
        {
            v[sentence[i]-'a']++;
        }
        for(int i=0;i<26;i++)
        {
            if(v[i]==0)
            {
                return false;
            }
        }
        return true;
    }
};