Workspace

Problem workspace

3 day streakD

Detect a Linked List Cycle

EasyLinked ListsFast & slow pointers

The challenge

Determine whether following next pointers ever revisits a node.

Compare node identity, not equal values. Do not modify any links.

Example

1 → 2 → 3 → 4 → node 2 contains a cycle.

Use the walkthrough below to inspect the input and each state change.

See Detect cycle, step by step

Follow the pointers. Watch each link change.

4 nodes · singly linkedIDs = node identity · ∅ = null
Cycle to node A2: Read the inputIDs label node objects. Equal values can belong to different nodes. Solid arrows are next links; dashed arrows are random links. Node positions stay fixed while arrows change. The pointer strip and node table below give the same state in text.head1A12A23A34A4
CurrentResultYellow arrow: changed next link
headA1
Inspect node links
Each row is a distinct node object. D is the dummy sentinel.
NodeValueNext
A11A2
A22A3
A33A4
A44A2
Step 01 / 6

Read the input

IDs label node objects. Equal values can belong to different nodes. Solid arrows are next links; dashed arrows are random links.

Start from the input head pointers.
View original input

A: 1 (A1) → 2 (A2) → 3 (A3) → 4 (A4); parameters: {"cycleAt":1}

Parameter indices are zero-based, except n from the end, which is one-based. Node IDs remain fixed when links change.

Put it into code

Inside a cycle, fast gains one position per iteration and must meet slow.

Node stores val and next; the random-pointer lesson adds random. C++ uses C++17 or later.

class Node:
    def __init__(self, val=0, next=None):
        self.val = val
        self.next = next


def has_cycle(head):
    slow = fast = head
    while fast and fast.next:
        slow = slow.next
        fast = fast.next.next
        if slow is fast:
            return True
    return False

A good place to start

Explore a pattern

A little guidance

Start with a pattern, read through a problem, and mark it solved when the idea clicks. Save anything you want to revisit.

New tutorials are added one at a time. Your bookmarks and solved checkmarks stay in this browser.

Explore the roadmap