  
  class LinkedList(object):
      def __init__(self, head=None):
          self.head = head
      
      def insert_to_front(self, data):
          if data is None:
              return
 
</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",
    def __len__(self):
        curr = self.head
        counter = 0
        while curr is not None:
            counter += 1
            curr = curr.next
        return counter
  
  class LinkedList(object):
      def __init__(self, head=None):
          self.head = head
    def __len__(self):
        curr = self.head
        counter = 0
        while curr is not None:
            counter += 1
            curr = curr.next
        return counter
      
      def insert_to_front(self, data):
          if data is None:
              return
keep keep keep add keep keep keep keep
 Added method to return the length of a linked list. 
linked-lists/linked_list.py