Challenge: Detect Loop in a Linked List
Loops in linked lists can be dangerous. Now, you'll create an algorithm to detect them.
We'll cover the following
Problem Statement #
By definition, a loop is formed when a node in your linked list points to a previously traversed node.
You must implement the detectLoop()
function, which will take a linked list as input and deduce whether or not a loop is present.
Input #
A singly linked list.
Output #
Returns true
if the given linked list contains a loop. Otherwise, it returns false
.
Sample Input #
linkedlist = 7->14->21->7 // Both '7's are the same node. Not duplicates.
Sample Output #
true
Level up your interview prep. Join Educative to access 70+ hands-on prep courses.