Grokking the Coding Interview Patterns/

...

/

Solution: Linked List Cycle III

Solution: Linked List Cycle III

Let’s solve the Linked List Cycle III problem using the Fast and Slow Pointers pattern.

We'll cover the following...

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 [0,104][0, 10^4]. ...