X-Git-Url: https://projects.mako.cc/source/wordplay-cdsw-solutions/blobdiff_plain/884ad8e21ea1ea9d1dd411b2a503d0dff4294c59..HEAD:/solution_6.py

diff --git a/solution_6.py b/solution_6.py
index e4d7b3e..93747c9 100644
--- a/solution_6.py
+++ b/solution_6.py
@@ -1,33 +1,34 @@
 import scrabble
 
-
-# Print hte longest word where every digit is unique.
+# Print the longest word where every character is unique.
 # I use a double loop in this. Note that I also re-use my "longest word" logic
 # from the easy solution to (2).
 
 # See the advanced solution for a shorter way to do this.
 
-
 new_words = []
 for word in scrabble.wordlist:
-    local_chars = {}
-    seen_before = False
+    unique_letters = []
+    duplicated_letters = False
     for character in word:
         # have we seen this character before?
-        if character in local_chars:
-            seen_before = True
-            break
-        # store the character
-        local_chars[character] = 1
-    
-    if not seen_before:
+        if character in unique_letters:
+            duplicated_letters = True
+        else:
+            # store the character
+            unique_letters.append(character)
+
+    if not duplicated_letters:
         new_words.append(word)
-            
-# Reuse my code for longest
-longest_so_far = ''
+
+# Reuse my code for longest word
+longest_so_far = []
+longest_length = 0
 for word in new_words:
-    if len(word) > len(longest_so_far):
-        longest_so_far = word
-        
-print longest_so_far
+    if len(word) > longest_length:
+        longest_so_far = [word]
+        longest_length = len(word)
+    elif len(word) == longest_length:
+        longest_so_far.append(word)
 
+print(longest_so_far)