diff --git a/Chapter 1 Arrays and strings/1.5. levenshtein.md b/Chapter 1 Arrays and strings/1.5. levenshtein.md
index 6df08d1..784e680 100644
--- a/Chapter 1 Arrays and strings/1.5. levenshtein.md	
+++ b/Chapter 1 Arrays and strings/1.5. levenshtein.md	
@@ -1,4 +1,4 @@
-# 1.4. Levenshtein distance
+# 1.5. Levenshtein distance
 
 ## Given two strings, check if they are one edit (or zero edits) away. Edits can be insertion, substitution or deletion
 
diff --git a/Chapter 1 Arrays and strings/1.5. levenshtein.py b/Chapter 1 Arrays and strings/1.5. levenshtein.py
index 955021b..46ad45e 100644
--- a/Chapter 1 Arrays and strings/1.5. levenshtein.py	
+++ b/Chapter 1 Arrays and strings/1.5. levenshtein.py	
@@ -42,7 +42,6 @@ def levenshtein(s1, s2):
                     return False
         return True
 
-
 class Test(unittest.TestCase):
     dataT = [("", ""), ("an", "a"), ("a", "an"), ("ane", "ae"),
              ("ane", "ne"), ("asdfgh", "asdgh"), ("asdf", "asgf")]