[tester34]

>which is (maxWordlength*26) long. Each segment of 26 represents a

>^We're going to assume normalized words, which are all lower case and no punctuation, comprised of English letters from the 26 character alphabet. Getting the set of all of the possible words of any given length, is also quite an exercise.

I hate solutions like this because they'd never be even close to being viable in real world