Linked List Cycle II

Try to solve the Linked List Cycle II problem.

We'll cover the following

Statement

Given the head of a linked list, return the node where the cycle begins. If there is no cycle, return nullptr. 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:

  • 0≤0 \leq Number of the nodes in the list ≤103\leq 10^3
  • −105≤-10^5 \leq Node.val ≤105\leq 10^5

Examples

Level up your interview prep. Join Educative to access 80+ hands-on prep courses.