"Simple" ahh solution
Intuition\n Describe your first thoughts on how to solve this problem. \n\n# Approach\n Describe your approach to solving the problem. \nTo check if a sentence 
# Intuition\n<!-- Describe your first thoughts on how to solve this problem. -->\n\n# Approach\n<!-- Describe your approach to solving the problem. -->\nTo check if a sentence is a pangram, initialize a HashSet to store unique characters from the input. Iterate through each character in the sentence, adding it to the set. After the loop, if the set size is 26 (indicating every letter in the alphabet is present),return true; otherwise, false.\n\n# Complexity\n- Time complexity:O(n)\n<!-- Add your time complexity here, e.g. $$O(n)$$ -->\n\n- Space complexity:O(n)\n<!-- Add your space complexity here, e.g. $$O(n)$$ -->\n\n# Code\n```java []\nclass Solution {\n    public boolean checkIfPangram(String sentence) {\n        HashSet<Character> set = new HashSet<>();\n        for(char c:sentence.toCharArray()){\n            set.add(c);\n        }\n        return set.size()==26;\n    }\n}\n```
['Java']