logo Practice-It logo

Main Page → Problems → Solve a Problem

isPerfectPangram

Language/Type: JavaScript strings return
Author: Melissa Medsker-Galloway (on 2016/11/18)

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").

Type your solution here:


This is a function problem. Write a JavaScript function as described. Do not write a complete program; just the function(s) above.

You must log in before you can solve this problem.


Log In

If you do not understand how to solve a problem or why your solution doesn't work, please contact your TA or instructor.
If something seems wrong with the site (errors, slow performance, incorrect problems/tests, etc.), please

Is there a problem? Contact a site administrator.