Search⌘ K
AI Features

Solution: Linked List Cycle III

Solution: Linked List Cycle III asks you to inspect a linked list and return the number of nodes in its cycle, or zero when following next pointers never revisits a node.

Statement

Given the head of a linked list, determine the length of the cycle present in the linked list. If there is no cycle, return 0.

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.

Constraints:

  • The number of nodes in the list is in the range ...