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. Prepare
  2. Algorithms
  3. Strings
  4. Pangrams
  5. Discussions

Pangrams

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