The following code solves the problem of detecting the staring node of a cycle in a linked list if there is one. The key idea is to use a slow and a fast pointer traversing the list, where slow moves one step forward at a time and the fast moves two steps forward at a time. If they is no cycle, fast
(ListNode head)
source not stored for this graph (policy: none)
nothing calls this directly
no outgoing calls
no test coverage detected