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 Solvers3993
Suggested Problems
-
Replace NaNs with the number that appears to its left in the row.
3059 Solvers
-
313 Solvers
-
Project Euler: Problem 9, Pythagorean numbers
1385 Solvers
-
"Low : High - Low : High - Turn around " -- Create a subindices vector
582 Solvers
-
Replace multiples of 5 with NaN
466 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!