We use cookies to ensure you have the best browsing experience on our website. Please read our cookie policy for more information about how we use cookies.
  1. Pangrams
  2. Discussions

Pangrams

Sort by

recency

|

403 Discussions

|

  • anthonymarchenko
     + 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"
}

    }

  • nina_forde
     + 0 comments

    def pangrams(s): # Write your code here pre_str=s.strip() pre_str=pre_str.replace(' ','') pre_str=pre_str.lower() alpha=set(pre_str) if len(alpha)<26 : return 'not pangram' else: return "pangram"

  • burak_kuzuu
     + 0 comments

    function pangrams(s) { let loverCaseString = s.toLowerCase(); const regex = /[a-zA-Z]/g; let pangrams = loverCaseString.match(regex); let uniqueChars = [... new Set(pangrams)]; return uniqueChars.length === 26 ? 'pangram' : 'not pangram'; }

  • erlandohbs
     + 0 comments
    function pangrams(myString: string): string {
    // Write your code here
    myString = myString.toLowerCase().trim()
    const s  = new Set(myString.split(''));
    let alpa = 'abcdefghijklmnopqrstuvwxyz'
    for(const data of s) {
        if(alpa.includes(data))  alpa= alpa.replace(data,"")
    }
    return alpa.length === 0 ? 'pangram' : 'not pangram'
}

  • hussein_s_alkha1
     + 0 comments

    hint: in typescript you can use

    let char = char.toLowerCase(); /a-z/,test(char) -> to test all alphabet (a-z and A-Z)

Join us

Create a HackerRank account

Be part of a 26 million-strong community of developers

Already have an account?Log in