X-Git-Url: https://projects.mako.cc/source/wordplay-cdsw-solutions/blobdiff_plain/4e09563052459f99272cfee99d44f8a9abce85cb..715cf79efb1139d981e5716ed14f471fbeaddb2a:/solution_6.py

diff --git a/solution_6.py b/solution_6.py
index e4d7b3e..62e13f2 100644
--- a/solution_6.py
+++ b/solution_6.py
@@ -1,13 +1,11 @@
 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 = {}
@@ -16,18 +14,17 @@ for word in scrabble.wordlist:
         # have we seen this character before?
         if character in local_chars:
             seen_before = True
-            break
+            break # Exit the loop early, since we've found a collision.
         # store the character
         local_chars[character] = 1
-    
+
     if not seen_before:
         new_words.append(word)
-            
-# Reuse my code for longest
+
+# Reuse my code for longest word
 longest_so_far = ''
 for word in new_words:
     if len(word) > len(longest_so_far):
         longest_so_far = word
-        
-print longest_so_far
 
+print longest_so_far