X-Git-Url: https://projects.mako.cc/source/wordplay-cdsw-solutions/blobdiff_plain/4e09563052459f99272cfee99d44f8a9abce85cb..d57af8e41dd0a0a46fc411ad2488d029244921e1:/solution_2_advanced.py

diff --git a/solution_2_advanced.py b/solution_2_advanced.py
index dc157a3..e4f056d 100644
--- a/solution_2_advanced.py
+++ b/solution_2_advanced.py
@@ -1,6 +1,5 @@
 import scrabble
 
-
 # What is the longest word that starts with a q?
 
 # This problem was ill-specified. What if there isn't a single longest word? What if
@@ -8,7 +7,6 @@ import scrabble
 # We designed this problem with that ambiguity in mind, because sometimes the thing
 # we want to measure may not exist, or may not exist in the way we anticipate.
 
-
 # This solution keeps EVERY word of the longest length.
 
 longest_so_far = [] 
@@ -17,15 +15,11 @@ length_of_longest_word = 0
 for word in scrabble.wordlist:
 
     if word[0] == 'q':
-	if len(word) > length_of_longest_word:
-	    length_of_longest_word = len(word)
-	    longest_so_far = [word]
-	elif len(word) == length_of_longest_word:
-	    longest_so_far.append(word)
+        if len(word) > length_of_longest_word:
+            length_of_longest_word = len(word)
+            longest_so_far = [word]
+        elif len(word) == length_of_longest_word:
+            longest_so_far.append(word)
             #print longest_so_far  # Use this to see the progression.
 
-
 print longest_so_far
-            
-
-