We use cookies to ensure you have the best browsing experience on our website. Please read our cookie policy for more information about how we use cookies.
I like the char array idea but would do it a little bit different: Make the string lower case, convert it to char array, sort it and than start from the beginning:
Check if start is 'a' and than check that every next char is bigger by one or equal to the char you testing.
Than make sure that the last one is 'z'.
If there is any hole, you know that there is a letter missing.
Pangrams
You are viewing a single comment's thread. Return to all comments →
I like the char array idea but would do it a little bit different: Make the string lower case, convert it to char array, sort it and than start from the beginning:
Check if start is 'a' and than check that every next char is bigger by one or equal to the char you testing. Than make sure that the last one is 'z'.
If there is any hole, you know that there is a letter missing.