      "    def __init__(self, head=None):\n",
      "        self.head = head\n",
      "    \n",
      "    def insert_to_front(self, data):\n",
      "        if data is None:\n",
      "            return\n",
      "        node = Node(data)\n",
 
</s> remove     "## Problem: Implement a linked list with insert, append, find, delete, and print methods\n",
 </s> add     "## Problem: Implement a linked list with insert, append, find, delete, length, and print methods\n",
    "\n",
    "    def __len__(self):\n",
    "        curr = self.head\n",
    "        counter = 0\n",
    "        while curr is not None:\n",
    "            counter += 1\n",
    "            curr = curr.next\n",
    "        return counter\n",
      "    def __init__(self, head=None):\n",
      "        self.head = head\n",
    "\n",
    "    def __len__(self):\n",
    "        curr = self.head\n",
    "        counter = 0\n",
    "        while curr is not None:\n",
    "            counter += 1\n",
    "            curr = curr.next\n",
    "        return counter\n",
      "    \n",
      "    def insert_to_front(self, data):\n",
      "        if data is None:\n",
      "            return\n",
      "        node = Node(data)\n",
keep add keep keep keep keep keep
 Added method to return the length of a linked list. 
linked-lists/linked-list.ipynb