Given a circular linked list of N nodes and an integer k, repeatedly traverse k nodes and delete the kth node until only a single node remains in the circular linked list, then return that node.
You've read your 3 free write-ups
Sign up free to keep reading. Your account opens the first 10 questions of every company.