From 63bf44efac25ee591562d2e2f5bff7d4c764c248 Mon Sep 17 00:00:00 2001
From: Donne Martin <donne.martin@gmail.com>
Date: Sun, 5 Jul 2015 16:50:16 -0400
Subject: [PATCH] Tweaked kth to last element challenge algorithm description.

---
 linked_lists/kth_to_last_elem/kth_to_last_elem_solution.ipynb | 4 ++--
 1 file changed, 2 insertions(+), 2 deletions(-)

diff --git a/linked_lists/kth_to_last_elem/kth_to_last_elem_solution.ipynb b/linked_lists/kth_to_last_elem/kth_to_last_elem_solution.ipynb
index 059ec3e..3e65a9c 100644
--- a/linked_lists/kth_to_last_elem/kth_to_last_elem_solution.ipynb
+++ b/linked_lists/kth_to_last_elem/kth_to_last_elem_solution.ipynb
@@ -66,13 +66,13 @@
     "## Algorithm\n",
     "\n",
     "* Setup two pointers, current and previous\n",
-    "* Give current a headstart, incrementing it once for k = 1, twice for k = 2, etc\n",
+    "* Give current a headstart, incrementing it once if k = 1, twice if k = 2, ...\n",
     "* Increment both pointers until current reaches the end\n",
     "* Return the value of previous\n",
     "\n",
     "Complexity:\n",
     "* Time: O(n)\n",
-    "* Space: In-place"
+    "* Space: O(1)"
    ]
   },
   {