      "        while curr is not None:\n",
      "            if curr.data < data:\n",
      "                left.append(curr.data)\n",
      "            else:\n",
      "                right.append(curr.data)\n",
      "            curr = curr.next\n",
      "        curr_left = left.head\n",
 
</s> remove     "    * Input:  4, 3, 7, 8, 10, 1, 10, 12\n",
    "    * Output: 4, 3, 7, 8, 1, 10, 10, 12"
 </s> add     "    * Input: 4, 3, 13, 8, 10, 1, 10, 12\n",
    "    * Output: 4, 3, 8, 1, 10, 10, 13, 12" </s> remove     "        linked_list.insert_to_front(7)\n",
 </s> add     "        linked_list.insert_to_front(13)\n", </s> remove     "        linked_list.insert_to_front(7)\n",
 </s> add     "        linked_list.insert_to_front(13)\n",
    "            elif curr.data == data:\n",
    "                right.insert_to_front(curr.data)\n",
      "        while curr is not None:\n",
      "            if curr.data < data:\n",
      "                left.append(curr.data)\n",
    "            elif curr.data == data:\n",
    "                right.insert_to_front(curr.data)\n",
      "            else:\n",
      "                right.append(curr.data)\n",
      "            curr = curr.next\n",
      "        curr_left = left.head\n",
keep keep add keep keep keep keep
 Fixed #21: Partitioning linked list problem: Does not work if item greater than partition value is to the left. 
linked_lists/partition/partition_solution.ipynb