Given the head of a linked list, determine whether the list contains a cycle. If a cycle exists, return the number of nodes present in the cycle. If no cycle exists, return 0.
You've read your 3 free write-ups
Sign up free to keep reading. Your account opens the first 10 questions of every company.