Question: Given a circular linked list, implement an algorithm that 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. In: A -> B -> C -> D -> D -> E -> C Out: C

From: Cracking the Coding Interview [McDowell]

Subject: Linked Lists

Load Another Question

Select a Subject

Select a Subject Algorithm Analysis Arrays and Strings Bit Manipulation C and Cpp Code Quality Combinatorial Search Concurrency Data Structures Databases Design Patterns Dynamic Programming General Graph Theory Hard Java Knowledge Based Linked Lists Math and Logic Puzzles Moderate Object-Oriented Design Recursion Recursion and Dynamic Programming Soft Skills Sorting and Searching Stacks and Queues System Design and Scalability Testing Threads and Locks Trees and Graphs