Hash Map Solution (with step by step explanation)
Intuition\nFor this problem we would use hashmap\n\n# Approach\nWe use hashmap for this problem to store all alphabet letter from input string, and then simply 
# Intuition\nFor this problem we would use hashmap\n\n# Approach\nWe use hashmap for this problem to store all alphabet letter from input string, and then simply check that size of our hashmap are equals to size of english alphabet.\n# Complexity\n- Time complexity:\nO(n) - we iterate only once to get all letters\n- Space complexity:\nO(1) - we create hashmap but we know that it can\'t grow more than 26, so it\'s constant from 0 to 26, but we can get n length sentience and this will not change size of hashmap\n# Code\n```\nclass Solution {\n    public boolean checkIfPangram(String sentence) {\n        // declare hashmap to store letters from sentience\n        Map<Character, Integer> hash = new HashMap<>();\n        // iterate over sentience:\n        for(int i = 0; i < sentence.length(); i++) {\n            // put letters into hashmap, since we dont neet to calculate specific number of letters we can just always set it to 1\n            hash.put(sentence.charAt(i), 1);\n        }\n        // if hashmap is size of english alphabet return true, false otherwise\n        return hash.size() == 26 ? true : false;\n    }\n}\n```
['Hash Table', 'Java']