fast & slow pointers

Advance one pointer two steps and one pointer one step (or one pointer n ahead) to find a cycle, the middle or the n-th from the end.

Builds on: linked list traversal