Given a string s, check if it is Pangram or not. A pangram is a sentence containing all letters of the English Alphabet.
Create alphabet letter sequences "abcdefghijklmnopqrstuvwxyz". If the algorithm checks all the letters in the alphabet and finds them all in the input string, it returns "true".
data = 'The quick brown fox jumps over the lazy dog.' alphabet = "abcdefghijklmnopqrstuvwxyz" s = data.lower() output = True for i in range(len(alphabet)): if alphabet[i] not in s: output = False break print(output)
const data = 'The quick brown fox jumps over the lazy dog.'; const alphabet = "abcdefghijklmnopqrstuvwxyz"; const str = data.toLowerCase(); let output = true; for (let i = 0; i < alphabet.length; i++) { if (str.indexOf(alphabet.at(i)) < 0) { output = false; break; } } console.log(output);