Easy java solution
Intuition\nCalculating the frequency of each alphabet \n Describe your first thoughts on how to solve this problem. \n\n# Approach\nStoring the frequency of eac
# Intuition\nCalculating the frequency of each alphabet \n<!-- Describe your first thoughts on how to solve this problem. -->\n\n# Approach\nStoring the frequency of each character and running a for loop to check whether if any character is missing or not\n<!-- Describe your approach to solving the problem. -->\n\n# Complexity\n- Time complexity: O(n)\n<!-- Add your time complexity here, e.g. $$O(n)$$ -->\n\n- Space complexity: O(1)\n<!-- Add your space complexity here, e.g. $$O(n)$$ -->\n\n# Code\n```\nclass Solution {\n    public boolean checkIfPangram(String s) {\n        int a[]=new int[26];\n        for(char c:s.toCharArray())\n        {\n            a[c-\'a\']++;\n        }\n        for(int i=0;i<26;i++)\n        {\n            if(a[i]==0)\n            {\n                return false;\n            }\n        }\n        return true;\n    }\n}\n```
['Hash Table', 'String', 'Java']