simplest solution you have never seen if you are a beginner[beats 100% of solution check it out
IntuitionApproachComplexity
Time complexity:o(n)

Space complexity:O(1)
Code
# Intuition
<!-- Describe your first thoughts on how to solve this problem. -->

# Approach
<!-- Describe your approach to solving the problem. -->

# Complexity
- Time complexity:o(n)
<!-- Add your time complexity here, e.g. $$O(n)$$ -->

- Space complexity:O(1)
<!-- Add your space complexity here, e.g. $$O(n)$$ -->

# Code
```java []
class Solution {
    public boolean checkIfPangram(String sentence) {
        if(sentence.length()<26) return false;
        for(char ch='a';ch<='z';ch++){
            if(sentence.indexOf(ch)<0){
                return false;
            }
         }
        return true;
    }
}


```
![WhatsApp Image 2025-01-05 at 23.05.56_57f6f144.jpg](https://assets.leetcode.com/users/images/00eda466-8dcd-4c3f-9cb7-5fb2a746208f_1736445535.0247056.jpeg)

['Hash Table', 'String', 'Java']