Pangrams

Sort by

recency

|

407 Discussions

|

  • + 0 comments
    public static string pangrams(string s)
        {
            s = s.ToLower();
            
            int[] alphabet = new int[26];
            
            foreach(char c in s){
                if(c >= 'a' && c <='z'){
                    alphabet[(int)c - (int)'a']++;
                }
            }
    
            return alphabet.Any(c => c == 0) ? "not pangram" : "pangram";
        }
    
  • + 0 comments

    return "pangram" if set('abcdefghijklmnopqrstuvwxyz').issubset(s.lower()) else "not pangram"

  • + 0 comments
        public static String pangrams(String s) {
        // Write your code here
            var letters = s.chars()
                .filter(c -> Character.isAlphabetic(c))
                .map(c -> Character.toLowerCase(c))
                .mapToObj(c -> c)
                .collect(Collectors.toSet());
            
            return letters.size() == 26 ? "pangram" : "not pangram";
        
    
  • + 0 comments

    Python

    def pangrams(s):
        alphabet={}
        for i in s.lower():
            if i.isalpha() and i in alphabet:
                alphabet[i]+=1
            elif i.isalpha() and i not in alphabet:
                alphabet[i]=0
        
        if len(alphabet)==26:
            return  "pangram"
        else:
            return "not pangram"
    
  • + 0 comments

    //Swift

    func pangrams(s: String) -> String { // Write your code here var set: Set = []

    for char in s {
        set.insert(char.lowercased())
    }
    
    set.remove(" ")
    if set.count == 26 {
        return "pangram"
    } else {
        return "not pangram"
    }
    

    }