From 20d5a6d12b45cbc2f2c13d30dddae04cb8e6f650 Mon Sep 17 00:00:00 2001
From: Donne Martin <donne.martin@gmail.com>
Date: Sun, 5 Jul 2015 16:48:46 -0400
Subject: [PATCH] Tweaked delete mid challenge algorithm discussion.

---
 linked_lists/delete_mid/delete_mid_solution.ipynb | 3 +--
 1 file changed, 1 insertion(+), 2 deletions(-)

diff --git a/linked_lists/delete_mid/delete_mid_solution.ipynb b/linked_lists/delete_mid/delete_mid_solution.ipynb
index d0f3c58..eb32c35 100644
--- a/linked_lists/delete_mid/delete_mid_solution.ipynb
+++ b/linked_lists/delete_mid/delete_mid_solution.ipynb
@@ -61,13 +61,12 @@
     "\n",
     "We'll need two pointers, one to the current node and one to the next node.  We will copy the next node's data to the current node's data (effectively deleting the current node) and update the current node's next pointer.\n",
     "\n",
-    "* Check for error cases listed above\n",
     "* set curr.data to next.data\n",
     "* set curr.next to next.next\n",
     "\n",
     "Complexity:\n",
     "* Time: O(1)\n",
-    "* Space: In-place"
+    "* Space: O(1)"
    ]
   },
   {