This code is a 'solution' to The Odin Project's Linked Lists Project, a segment within their Computer Science course.
append(value)adds a new node with the specified value to the end of the linked list. If the list is empty, the node is added to the startprepend(value)adds a new node with the given value to the beginning of the listsize()returns the total number of nodes in the listhead()returns the first node in the listtail()returns the last node in the listat(index)returns the node at the specified index, or an error message if the index is invalidpop()removes the last element from the listcontains(value)returns true if the specified value is present in the list, otherwise falsefind(value)returns the index of the node containing the specified value or null if not foundtoString()returns a representation of the linked list as a string in the format:( value ) -> ( value ) -> ( value ) -> null