I'd go for a sieve algorithm on the 26 letters. Just my $.02.
Edit: An array of 26 values that represent the 26 letters of the alphabet. Then scan the string, checking each letter as you encounter it. At the end, check if the 26 letters have been checked.