Cracking The Coding Interview/Q 2.6

From Software Engineers Wiki
Jump to: navigation, search

Given a circular linked list, implement an algorithm which returns the node at the beginning of the loop.

DEFINITION

Circular linked list: A (corrupt) linked list in which a node's next pointer points to an earlier node, so as to make a loop in the linked list.

EXAMPLE

  • Input: A - > B - > C - > D - > E - > C [the same C as earlier]
  • Output: C

Answer

Please refer to Linked List/Detect a Cycle.

Personal tools
Namespaces

Variants
Actions
Navigation
Toolbox