StackScholar

Circular linked list

medium

No null terminator, so every traversal needs a different stop condition - walk until you return to where you started. Forget that and you loop forever.

Best O(1) insertWorst O(n) searchSpace O(n)
Loading the circular linked list engine…

Where to go next

Singly linked list

easy

O(1) at the head, a walk for everything else.

Circular queue (ring buffer)

medium

Modulo turns a fixed array into an endless stream.

Floyd's cycle detection

medium

Tortoise and hare, in O(1) memory.