Linked List Cycle
Try to solve the Linked List Cycle problem.
We'll cover the following...
Statement
Given the head
of a linked list, determine whether the list contains a cycle. A cycle exists if a node in the list can be revisited by continuously following the next
pointers. Return TRUE if a cycle is present; otherwise, return FALSE.
Constraints:
Let n
be the number of nodes in a linked list.