STRINGS
DATA STRUCTURES
FUNDAMENTALS
A pangram is a sentence that contains every single letter of the alphabet at least once. For example, the sentence "The quick brown fox jumps over the lazy dog" is a pangram, because it uses the letters A-Z at least once (case is irrelevant).
Given a string, detect whether or not it is a pangram. Return True if it is, False if not. Ignore numbers and punctuation.
const ALPHABET = 'abcdefghijklmnopqrstuvwxyz'
const onlyLettersRegex = new RegExp(/[^a-z]+/, 'gi')
const getUniqueLetters = array => {
return array.filter(
(letter, position, self) => self.indexOf(letter) === position,
)
}
const isPangram = string => {
const arrayWithLowerCaseLetters = string
.toLowerCase()
.replace(onlyLettersRegex, '')
.split('')
return (
getUniqueLetters(arrayWithLowerCaseLetters).sort().join('') === ALPHABET
)
}