Problem 27. Pangrams!
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
-
1 Comment
yes
-
1 Comment
Good one .
-
1 Comment
nice one-liner :)
-
2 Comments
Funny system they have for measuring length - this sure looks like the shortest.
. . . punctuation marks
-
3 Comments
This will fail if the sentence contains enough non-alphabetical letters!
or if it's just 'ABCDEFGHIJKLMNOPQRSTUVWXYZ';
Or if it is 'aAbBcCdDeEfFgGhHiIjJkKlLmMnNoOpPqQrRsS'
-
1 Comment
i think my solution is correct but the system seems to get it wrong
-
1 Comment
This would not work if punctuation was included in the string, or if spaces were not included in the string, or if capital and lower case letters were duplicated, but letters were still missing.
For example:
'ABCDEFabcdefghijklmnopqrstuvwxy'
-
1 Comment
this would not work if the string was 'szv'
-
1 Comment
there is a false positive on 'The quick brown fox jumps over a lazy do!'
Problem Recent Solvers3006
Suggested Problems
-
320 Solvers
-
463 Solvers
-
Find nearest prime number less than input number
439 Solvers
-
2496 Solvers
-
710 Solvers
More from this Author95
Problem Tags
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!