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 Solvers3891
Suggested Problems
-
Calculate the Levenshtein distance between two strings
1454 Solvers
-
Who knows the last digit of pi?
672 Solvers
-
Sum of diagonal of a square matrix
1589 Solvers
-
2387 Solvers
-
9582 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!