      "    * Set the final node's next to the new node\n",
      "\n",
      "Complexity:\n",
      "* Time: O(n)\n",
      "* Space: O(1), a new node is added\n",
      "\n",
      "### Find\n",
      "\n",
      "* If data we are finding is NULL, return\n",
      "* If the list is empty, return\n",
 
</s> remove     "* Space: O(1), a new node is added\n",
 </s> add     "* Space: O(1)\n", </s> remove     "* Space: In-place\n",
 </s> add     "* Space: O(1)\n", </s> remove     "* Space: In-place\n",
 </s> add     "* Space: O(1)\n", </s> remove     "* Space: In-place\n",
 </s> add     "* Space: O(1)\n", </s> remove     "* Space: In-place"
 </s> add     "* Space: O(1)"
    "* Space: O(1)\n",
      "    * Set the final node's next to the new node\n",
      "\n",
      "Complexity:\n",
      "* Time: O(n)\n",
    "* Space: O(1)\n",
      "\n",
      "### Find\n",
      "\n",
      "* If data we are finding is NULL, return\n",
      "* If the list is empty, return\n",
keep keep keep keep replace keep keep keep keep keep
 tweaked linked list challenge algorithm discussion. 
linked_lists/linked_list/linked_list_solution.ipynb