Middle of the linked list

Two pointers start at the head. fast takes two steps for every one step of slow, so when fast reaches the end, slow has covered half the list — it is on the middle node.

On the linked list, slow moves 1 node a step and fast moves 2.