Java Simple and easy to understand solution, 1 ms, faster than 100.00%, clean code with comments
PLEASE UPVOTE IF YOU LIKE THIS SOLUTION\n\n\n\nclass Solution {\n    public boolean checkIfPangram(String sentence) {\n        boolean[] letters  = new boolean[
**PLEASE UPVOTE IF YOU LIKE THIS SOLUTION**\n\n\n```\nclass Solution {\n    public boolean checkIfPangram(String sentence) {\n        boolean[] letters  = new boolean[26];\n        \n        for(char c : sentence.toCharArray()) {\n            letters[c - \'a\'] = true;\n        }\n        \n        //find any letter that not exist\n        for(boolean existLetter : letters) {\n            if(!existLetter) return false;\n        }\n        \n        return true;\n    }\n}\n```
['Java']