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
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!
Solution Comments
Show commentsProblem Recent Solvers3918
Suggested Problems
-
Find all elements less than 0 or greater than 10 and replace them with NaN
15682 Solvers
-
Arrange Vector in descending order
12479 Solvers
-
Who has power to do everything in this world?
466 Solvers
-
540 Solvers
-
337 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!