Circular queue · wraparound

A circular queue reuses a fixed buffer by wrapping read and write positions back to zero.

Remember: Wrap indices; count items.

Example: Capacity 3: advancing index 2 gives (2+1)%3 = 0.

Time: O(1) / op. Auxiliary space: O(capacity).

Formula: tail = (tail + 1) % capacity

tail means next write index. Track size: front == tail can mean full or empty.

Complexities describe the underlying algorithm; tutorial snapshots and rendering can use additional resources.

The interactive workspace loads here when JavaScript is available. You can still browse the learning notes and links above without it.