[0ms] Java Easy Solution w/ Array && .indexOf
\nclass Solution {\n    public boolean checkIfPangram(String sentence) {\n        if (sentence.length() < 26) {\n            return false;\n        }\n\n       
```\nclass Solution {\n    public boolean checkIfPangram(String sentence) {\n        if (sentence.length() < 26) {\n            return false;\n        }\n\n        int[] tracer = new int[26]; //For Storing Index of a-z charecters from sentence;\n        char alpha = \'a\'; \n        for (int i = 0; i < tracer.length; i++) {\n            tracer[i] = sentence.indexOf(alpha); //assigning index of alphabets\n            \n            if (tracer[i] == -1) {\n                return false; \n                //if any alphabet isn\'t present -1 will be stored in array && return with false value;\n            }\n            alpha++; //else increment of alphabet\n\n        }\n        return true; //there isn\'t any -1 stored in array so every alphabet will be present\n    }\n}\n```
['Java']