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
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
Funny system they have for measuring length - this sure looks like the shortest.
. . . punctuation marks
This will fail if the sentence contains enough non-alphabetical letters!
or if it's just 'ABCDEFGHIJKLMNOPQRSTUVWXYZ';
Or if it is 'aAbBcCdDeEfFgGhHiIjJkKlLmMnNoOpPqQrRsS'
i think my solution is correct but the system seems to get it wrong
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'
this would not work if the string was 'szv'
there is a false positive on 'The quick brown fox jumps over a lazy do!'
365 Solvers
307 Solvers
Magic is simple (for beginners)
680 Solvers
389 Solvers
463 Solvers