diff options
Diffstat (limited to 'challenge-111/abigail/README.md')
| -rw-r--r-- | challenge-111/abigail/README.md | 28 |
1 files changed, 27 insertions, 1 deletions
diff --git a/challenge-111/abigail/README.md b/challenge-111/abigail/README.md index def177b2a6..5f00924966 100644 --- a/challenge-111/abigail/README.md +++ b/challenge-111/abigail/README.md @@ -10,7 +10,6 @@ ### Notes - ### Solutions ### Blog @@ -24,7 +23,34 @@ > Write a script to find the longest English words that don't change when > their letters are sorted. +### Notes +We will grep the words from standard input which don't change +if they are sorted; these are the words which match the pattern +/^a*b*c*...z*$/i. We keep track of the longest word. + +If course, there does not have to be a unique word. It will depend +on the word list used to search in. For instance, three different +word list I used give different results: + + infochimps.com /usr/share/dict/words enable.lst + -------------- --------------------- ---------- + Adelops + aegilops + alloquy + beefily beefily + begorry + billowy billowy + egilops + +Only one of them has a unique longest word. + +We will be reading a word list from standard input, and write +the longest word where the letters are in alphabetical order +to standard output. In case of ties, we print the first one found. + + ### Solutions +* [Perl](perl/ch-2.pl) ### Blog |