Answer: LOGITECH INDIA Off-Campus Hiring | Online Assessment Question (2022)

Approach 1: Boolean Array Create a boolean array of size 26. Mark every character encountered. Check whether all positions are marked. Java Code class Solution { public boolean checkIfPangram(String sentence) { boolean[] seen = new boolean[26]; for (char c : sentence.toCharArray()) { seen[c - 'a'] = true; } for (boolean b : seen) { if (!b) { return false; } } return true; } } Time Complexity O(n) Space Complexity O(1)