Java Basic and Simple logic, 0ms 100% faster, 40.6 MB beats 76% in memory Clean Code
Intuition\nRun a loop over letter a - z and check whether each char occurs in the String\n\n# Approach\nIterate over 26 available alphabets and check whether we
# Intuition\nRun a loop over letter a - z and check whether each char occurs in the String\n\n# Approach\nIterate over 26 available alphabets and check whether we have the character in the String.\n\n# Complexity\n- Time complexity:\nO(1). Instead of running over every character in the string which can range from 0 to 1000, we can run over 26 alphabets. \n\n- Space complexity:\nUse byte type to declare the iterator variable since we need numbers from 97 to 122 inclusive. Using byte will consume 1 byte where int consumes 4 bytes of memory.\n\n\n# Code\n```\nclass Solution {\n    public boolean checkIfPangram(String sentence) {\n        for( byte i = 97;i<=122;i++ ){\n            if( sentence.indexOf( i ) == -1 ){\n                return false;\n            }\n        }\n        return true;\n    }\n}\n```
['String', 'Java']