Problem 27. Pangrams!
A pangram, or holoalphabetic sentence, is a sentence using every letter of the alphabet at least once.
Example:
Input s = 'The quick brown fox jumps over the lazy dogs' Output tf = true
Solution Stats
Problem Comments
-
9 Comments
Show
6 older comments
Jiahang Li
on 7 Feb 2018
funny
Sanzhar Askaruly
on 18 Jun 2019
haha
Chul Min Yeum
on 4 Oct 2019
Great problem!
Solution Comments
Show commentsGroup

CodeCrunch 1
- 11 Problems
- 10 Finishers
- Calculate the height of an object dropped from the sky
- Compute the missing quantity among P, V, T for an ideal gas
- Remove duplicated triangles
- An Ohm's Law Calculator
- Laws of motion 6
- Find the longest sequence of 1's in a binary sequence.
- Determine whether a vector is monotonically increasing
- Calculate the probability that at least two people in a group share the same birthday.
- Finding Perfect Squares
- The Goldbach Conjecture
- Pangrams!
Problem Recent Solvers3910
Problem Tags
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!