Cycle Node In Linkedlist
easy
1. Given a linked list, return the node where the cycle begins. If there is no cycle, return null. 2. 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. Notice that you should not modify the linked list.
Constraints
0 <= N <= 10^6
Format
Input
input is handle for you
Output
output is handle for you
Example
Sample Input
8
1
18
1
8
-1
138
31
84
3
Sample Output
8