You are viewing a single comment's thread. Return to all comments →
Java Solution
Set<Integer> alphabet = new HashSet<>(); char[] arr = s.toLowerCase().toCharArray(); for (int i=0; i<arr.length; i++) { if (arr[0] != 32) { alphabet.add((int)arr[i]); } } if (alphabet.size() == 27) { return "pangram"; } return "not pangram";
Seems like cookies are disabled on this browser, please enable them to open this website
Pangrams
You are viewing a single comment's thread. Return to all comments →
Java Solution