aboutsummaryrefslogtreecommitdiff
path: root/challenge-005/jaime/README
diff options
context:
space:
mode:
Diffstat (limited to 'challenge-005/jaime/README')
-rw-r--r--challenge-005/jaime/README24
1 files changed, 23 insertions, 1 deletions
diff --git a/challenge-005/jaime/README b/challenge-005/jaime/README
index 5b29651691..46e62dafa4 100644
--- a/challenge-005/jaime/README
+++ b/challenge-005/jaime/README
@@ -1 +1,23 @@
-Solution by Jaime Corchado.
+Solution by Jaime Corchado, (@tortsnare)[https://twitter.com/tortsnare].
+
+#Challenge #1
+Write a program which prints out all anagrams for a given word.
+
+## Solution
+Lookup anagrams in a hash of Engligh words.
+
+The script does initialize a list of words from Webster's Second International dictionary,
+ but I removed any hyphenated or capitalized words.
+
+All words are keyed by alphabetical order. `join "", sort split //`
+Words that are anagrams of one another share the same key.
+Words that are not anagrams, do not share a key.
+
+The script reports the anagrams of its arguments by looking up all words that share the key.
+
+#Challenge #2
+Write a program to find the sequence of characters that has the most.
+
+## Solution
+The English words are hashed as before.
+The script tracks the key with the most additions.