In this post we will solve the LeetCode 141 Linked List Cycle problem.
Given head, the head of a linked list, determine if the linked list has a cycle in it. There is a cycle in a linked list if there is some node in the list that can be reached again by continuously following the next pointer. Internally, pos is used to denote the index of the node that tail's next pointer is connected to. Note that pos is not passed as a parameter. Return true if there is a cycle in the linked list. Otherwise, return false. Constraints: o The number of the nodes in the list is in the range [0, 10^4]. o -10^5 <= Node.val <= 10^5 o pos is -1 or a valid index in the linked-list. Related Topics: o Hash Table o Linked List o Two Pointers
We are given a singly linked list and are asked to determine if there is a cycle in it. If interested in the problem please take a look at the current description of it in the LeetCode website. Continue reading “LeetCode 141 Linked List Cycle in Java”