      "## Constraints\n",
      "\n",
      "* Can we assume this is a non-circular, singly linked list?\n",
      "    * Yes\n",
      "* What if the final node is being deleted, for example a single node list?  Do we make it a dummy with value None?\n",
      "    * Yes\n",
      "* Can we assume we already have a linked list class that can be used for this problem?\n",
      "    * Yes"
     ]
    },
 
</s>
    "* What if the final node is being deleted, do we make it a dummy with value None?\n",
      "## Constraints\n",
      "\n",
      "* Can we assume this is a non-circular, singly linked list?\n",
      "    * Yes\n",
    "* What if the final node is being deleted, do we make it a dummy with value None?\n",
      "    * Yes\n",
      "* Can we assume we already have a linked list class that can be used for this problem?\n",
      "    * Yes"
     ]
    },
keep keep keep keep replace keep keep keep keep keep
 Update LL delete mid challenge (#112)

Update constraints and assumptions, solution, and test case.
linked_lists/delete_mid/delete_mid_solution.ipynb