Linked List Cycle
Try to solve the Linked List Cycle problem.
We'll cover the following
Statement
Check whether or not a linked list contains a cycle. If a cycle exists, return TRUE. Otherwise, return FALSE. The cycle means that at least one node can be reached again by traversing the next
pointer.
Constraints:
Let n
be the number of nodes in a linked list.
-
n
-
Node.data
Examples
Create a free account to view this lesson.
By signing up, you agree to Educative's Terms of Service and Privacy Policy