Linked List Cycle II

Problem

Given a linked list, return the node where the cycle begins.

If there is no cycle, return null.

Example

Given -21->10->4->5, tail connects to node index 1, return 10

Challenge

Follow up: Can you solve it without using extra space?