     "metadata": {},
     "source": [
      "## Algorithm\n",
      "\n",
      "* Test error cases\n",
      "* Create left and right linked lists\n",
      "* For each element in the list\n",
      "    * If elem < x, append to the left list\n",
      "    * else, append to the right list\n",
      "* Merge left and right lists\n",
 
</s> remove     "## Clarifying Questions\n",
 </s> add     "## Constraints and Assumptions\n",
    "\n",
    "*Problem statements are often intentionally ambiguous.  Identifying constraints and stating assumptions can help to ensure you code the intended solution.*\n", </s> remove     "* X invalid\n",
 </s> add  </s> remove     "* [Clarifying Questions](#Clarifying-Questions)\n",
 </s> add     "* [Constraints and Assumptions](#Constraints-and-Assumptions)\n",
     "metadata": {},
     "source": [
      "## Algorithm\n",
      "\n",

      "* Create left and right linked lists\n",
      "* For each element in the list\n",
      "    * If elem < x, append to the left list\n",
      "    * else, append to the right list\n",
      "* Merge left and right lists\n",
keep keep keep keep replace keep keep keep keep keep
 Reworked notebook: Added more detail to constraints and test cases.  Reworked code and unit test. 
linked-lists/partition.ipynb