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 Solvers4015
Suggested Problems
-
Return the largest number that is adjacent to a zero
5547 Solvers
-
Find the two most distant points
2959 Solvers
-
Project Euler: Problem 10, Sum of Primes
2131 Solvers
-
Get the elements of diagonal and antidiagonal for any m-by-n matrix
524 Solvers
-
Area of an equilateral triangle
7009 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!