Skip to content

Glossary: Coding Interviews in Go

Cycle

A linked list whose last node links back to an earlier one, so a plain walk never ends. Fast and slow pointers detect it when they meet on the same node.

Where the book teaches it

Related terms

Fast and slow pointersLinked list