Detect and Print Cycle in a Linked List

Start by clarifying the exact contract for Print Linked-List Cycle: input representation, mutation rules, duplicate behavior, and what should happen on invalid or empty input. The core idea is locating cycle entry after floyd detection without infinite traversal. Work a tiny example aloud and name the invariant after each step, because that is the proof that the approach stays correct as the input grows.

A dependable implementation plan is to find a slow-fast meeting; reset one pointer to head; move both one hop to entry; walk once around entry to collect output. The meeting point is not necessarily the cycle entry. Keep the code aligned with that invariant instead of adding special cases that silently change the contract. Test the smallest input, a normal case, duplicates or ties where relevant, an adversarial boundary, and a case that exercises the failure path. The expected complexity is O(n) time and O(1) auxiliary space. Explain both time and auxiliary memory, including recursion or helper structures; do not hide sorting, copying, or repeated scans. If the title omits critical constraints, say what you need to know before committing to a more specialized solution.