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.

&nbsp;
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


&nbsp;
Constraints:


	1 &lt;= sentence.length &lt;= 1000
	sentence consists of lowercase English letters.


class Solution:
    def checkIfPangram(self, sentence: str) -> bool:
        return len(set(sentence))==26
class Solution {
    public boolean checkIfPangram(String sentence) {
        int seen = 0;
        for(char c : sentence.toCharArray()) {
            int ci = c - 'a';
            seen = seen | (1 << ci);
        }
        return seen == ((1 << 26) - 1);
    }
}
class Solution {
public:
    bool checkIfPangram(string sentence) {
        vector<int> v(26,0);
        for(auto x:sentence)
        {
            v[x-'a'] = 1;
        }
        return accumulate(begin(v),end(v),0) == 26;
    }
};
var checkIfPangram = function(sentence) {
    return new Set(sentence.split("")).size == 26;
};
Check if the Sentence Is Pangram