Please Login in order to post a comment
Java solution comparing to ASCII codes.
public static String pangrams(String s) { Set<String> appearence = new HashSet<>(); String lowercased = s.toLowerCase(); for(int i=0;i < lowercased.length();i++){ if((int) lowercased.charAt(i) >= 97 && (int) lowercased.charAt(i) <= 122){ appearence.add((String.valueOf(lowercased.charAt(i)))); } } return appearence.size() == 26 ? "pangram":"not pangram"; }
C#
string lowerString = s.ToLower();
List<char> alphabet = new List<char> {'a', 'b','c','d','e','f','g','h','i','j','k','l','m','n','o','p','q','r','s','t','u','v','w','x','y','z'}; foreach (char letter in alphabet) { if(!lowerString.Contains(letter)) { return "not pangram"; } } return "pangram";
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";
C++
string pangrams(string s) { vector<int> list_alphabet(26, 0); for (auto &character : s) { int dec_character = static_cast<int>(character); if (dec_character >= 65 && dec_character <= 90){ list_alphabet[dec_character % 64]++; } else if (dec_character >= 97 && dec_character <= 122) { list_alphabet[(dec_character - 32) % 64]++; } } for (int i = 1; i <= 26; i++) { if (list_alphabet[i] < 1) { return "not pangram"; } } return "pangram"; }
Java
public static String pangrams(String s) { s = s.toLowerCase().replaceAll("\\s+",""); ArrayList<String> list = new ArrayList<String>(Arrays.asList(s.split(""))); long result = list.stream().distinct().count(); if(result == 26L){ return "pangram"; } return "not pangram"; }
Seems like cookies are disabled on this browser, please enable them to open this website
Java solution comparing to ASCII codes.
C#
Java Solution
C++
Java