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
Dennis J
on 4 Jul 2013
The test suite should be expanded to contain a sentence with 25 unique letters and some non-letters.
Dan Brackmann
on 12 Feb 2015
I know im not really efficient in my code but how do people get solutions of length 10?
Brian
on 14 Jul 2015
they use something in the form of
function variable_output=func_name(variable_youre_running_on)
regexp '' '(?@variable_youre_running_on,all_regular_work_pasted_here);'
Jerivington
on 30 May 2016
ASCII table came useful
SeWoong Lee
on 31 Oct 2016
Good!
Santosh Kumar Choudhary
on 23 Sep 2017
good problem
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 Solvers3823
Suggested Problems
-
2578 Solvers
-
1194 Solvers
-
956 Solvers
-
Change the sign of even index entries of the reversed vector
537 Solvers
-
985 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!