Tap here to switch tabs
Problem
Submissions

Problem: Linked List Cycle II

Linked List Cycle II asks you to inspect a linked list and return the node where a cycle begins, or null when no cycle exists. The cycle may connect back to any earlier node.

Statement

Given the head of a linked list, return the node where the cycle begins. If there is no cycle, return null.

A cycle exists in a linked list if there is some node in the list that can be reached again by continuously following the next pointer. Internally, pos denotes the node’s index to which the tail’s next pointer is connected.

Constraints:

  • The number of the nodes in the list is in the range [0,104][0, 10^4].

  • −105≤-10^5 \leq Node.value ≤105\leq 10^5

  • pos is -11 or a valid index in the linked list.

Note: The pos parameter isn’t passed as a parameter.

⋮
Tap here to switch tabs
Problem
Submissions

Problem: Linked List Cycle II

Linked List Cycle II asks you to inspect a linked list and return the node where a cycle begins, or null when no cycle exists. The cycle may connect back to any earlier node.

Statement

Given the head of a linked list, return the node where the cycle begins. If there is no cycle, return null.

A cycle exists in a linked list if there is some node in the list that can be reached again by continuously following the next pointer. Internally, pos denotes the node’s index to which the tail’s next pointer is connected.

Constraints:

  • The number of the nodes in the list is in the range [0,104][0, 10^4].

  • −105≤-10^5 \leq Node.value ≤105\leq 10^5

  • pos is -11 or a valid index in the linked list.

Note: The pos parameter isn’t passed as a parameter.