logo CodeStepByStep logo

Main Page → Exercises → JavaScript → Solve an Exercise

isPerfectPangram

Language/Type: JavaScript string return
Author: Melissa Hovik (on 2016/09/25)

Write a function named isPerfectPangram that accepts a string and returns true if the string is a perfect pangram. As covered in the previous problem, isPangram, a pangram is any phrase that contains at least one of each of the 26 letters in the English alphabet (ignoring letter-casing).

A pangram is considered "perfect" if and only if it contains a single occurrence of each letter in the alphabet (non-alphabetic characters are ignored). For example, a call to isPangram("Mr. Jock, TV quiz PhD, bags few lynx.") should return true since it contains exactly one occurance of each 26 letters in the alphabet. However, a call of isPangram("The quick brown fox jumps over a lazy dog.") should return false since some letters occur more than once (e.g., "a" and "o").

Function: Write a JavaScript function as described, not a complete program.

You must log in before you can solve this problem.

Log In

Need help?

Stuck on an exercise? Contact your TA or instructor.

If something seems wrong with our site, please

Is there a problem? Contact us.