100% Faster Solution with 0 ms
\nI come with the solution to this question with three different approach:\nFirst Approach:\nUsing String \nclass Solution {\n    public boolean checkIfPangram(
```\nI come with the solution to this question with three different approach:\nFirst Approach:\nUsing String \nclass Solution {\n    public boolean checkIfPangram(String sentence) {\n       if(sentence.length()<26){\n           return false;\n       }\n      String s="abcdefghijklmnopqrstuvwxyz";\n      for(int i=0;i<s.length();i++){\n          if(sentence.indexOf(s.charAt(i))==-1){\n              return false;\n          }\n      }\n        return true;\n}\n}\n\n```\n```\nSecond Approach:\nUsing Array\n\nclass Solution {\n    public boolean checkIfPangram(String sentence) {\n        int arr[]=new int[26];\n        for(char x:sentence.toCharArray()){\n            arr[x-\'a\']++;\n        }\n        for(int i=0;i<26;i++){\n            if(arr[i]==0){\n                return false;\n            }\n        }\n        return true;\n    }\n}\n```\n```\nThird Approach:\nUsing HashSet\n\n\n\n\nclass Solution {\n    public boolean checkIfPangram(String sentence) {\n        HashSet<Character> h = new HashSet<>();\n        for(char x:sentence.toCharArray()){\n            h.add(x);\n        }\n        if(h.size()==26){\n            return true;\n        }\n        return false;\n    }\n}\n```
['Array', 'String', 'Java']