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
Solution Comments
Show comments
Loading...
Problem Recent Solvers4011
Suggested Problems
-
Return the largest number that is adjacent to a zero
5542 Solvers
-
Number of 1s in a binary string
11488 Solvers
-
446 Solvers
-
find the maximum element of the matrix
542 Solvers
-
Find the index of the largest value in any vector X=[4,3,4,5,9,12,0,4.....5]
405 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!
The test suite should be expanded to contain a sentence with 25 unique letters and some non-letters.
I know im not really efficient in my code but how do people get solutions of length 10?
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);'
ASCII table came useful
Good!
good problem
funny
haha
Great problem!