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 commentsProblem Recent Solvers3890
Suggested Problems
-
The Goldbach Conjecture, Part 2
2367 Solvers
-
Create a Multiplication table matrix...
575 Solvers
-
485 Solvers
-
The Answer to Life, the Universe, and Everything
542 Solvers
-
Number of Even Elements in Fibonacci Sequence
1431 Solvers
More from this Author96
Problem Tags
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!