Sort by

recency

|

1940 Discussions

|

  • + 0 comments

    Here is problem solution in python java c++ c and javascript - https://programmingoneonone.com/hackerrank-pangrams-problem-solution.html

  • + 0 comments

    python

    def pangrams(s):
        l = set(s.lower())
        if " " in l:
            l.remove(" ")
        
        return "pangram" if len(l) == 26 else "not pangram"
    
  • + 0 comments

    C++ Easy Solution

    string pangrams(string s) {
        unordered_set<char> res;
        for(char c : s){
            if(isalpha(c)){
                res.insert(tolower(c));
            }
        }
        return (res.size()==26)? "pangram":"not pangram";
    }
    
  • + 0 comments

    easy solution in C++ Count Unique character https://www.hackerrank.com/challenges/pangrams/submissions/code/430735849

  • + 0 comments

    My C++ solution:

    string pangrams(string s) {
        bitset<26> alpha;
        for(char c: s){
            int temp = tolower(c) - 'a';
            if(temp > 25 || temp < 0)continue;
            alpha.set(temp);
        }
        if(alpha.count() == 26)return "pangram";
        return "not pangram";
    }