Sort by

recency

|

1942 Discussions

|

  • + 0 comments
    function pangrams(s) {
        s = Array.from(new Set(s.toLowerCase().split("").filter((x)=> x <= 'z' && x >= 'a').join("")))
        console.log(s)
        if(s.length >= 26)
            return "pangram";
        return "not pangram"
    }
    
  • + 0 comments

    Here is a TypeScrip solution with O(n) time and O(1) space.

    I know the apace can also be consider O(n) because it grows; however, it will never be bigger then 26 (size of alphabet) so it can be consider constant space.

    function pangrams(s: string): string {
        const alpha: string = "abcdefghigklmnopqrstuvwxyz"
        let content = new Set()
        for (let ch of s.toLocaleLowerCase()) {
            if (alpha.includes(ch)) {
                content.add(ch)
            }
        }
        
        if (content.size === 25) 
            return "pangram ";
        else
            return "not pangram ";
    }
    
  • + 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";
    }