Insert creates a new Node, named newNode. If there's already a head Node in the LinkedList, current is set to the head and then it's advanced to the end of the list, then newNode is inserted there. If there's no head node, the newNode is made the head. More on reddit.com

Python's dictionaries are implemented in C using both arrays and linked lists (IIRC), but outside of specific applications I wouldn't say they're common in modern code. While they have a theoretical speed benefit for writes, in practice this rarely happens because unlike arrays they don't really benefit from CPU caching due to the nodes being all over the memory rather than in continuous blocks, so the only real benefit they offer is storing data when the memory is fragmented and there's no room for a continuous block an array would need. I've written a few linked list implementations for fun, but personally I haven't been in a scenario where I'd want to use one. More on reddit.com

We create a new local variable called current inside the append method and we set it to the head of the list. ...which is an instance of Node What property about current allows us to use .next ? This has nothing to do with current; current is just a name. .next() belongs to the Node instance. current.next() is the .next() method belonging to whatever current points to. Since current is just a variable and currently unrelated to the Node class It is absolutely related to the Node class by way of it being assigned a value that is an instance of the Node class. I don't know what you mean by "just a variable", but whatever it is, I think you're attributing WAY too much meaning to it. This behavior is exactly what a variable is for. Does this .next differ from .next() we see with other iterators? Iterators do not have a .next() method. There is a built-in next() method, which operates on iterators, but that method is generic--it doesn't belong to any iterator. Iterators have a magic method __next__(), but again this is a different name and, therefore a different method than either the built-in next() or the .next() you are asking about. So, yes, it differs from any method related to iterators, including .next() if they had one. current = self.head while current.next: # equivalent to while self.head.next current = current.next # equivalent to current = self.head.next More on reddit.com

You want to loop until curr points to the n-1th node. Then: curr.next = curr.next.next As with many algorithms there are special cases you have to allow for: End of the list before getting to the n-1th node curr.next is None when at the n-1th node More on reddit.com