Circling on and on

Computer Science Level pending

A Circular Linked List is a linked list whose last element has a pointer pointing back to the first element.


A circular linked list of 10 nodes consists of integers in a strictly increasing order from the head to the tail.

Now, suppose you are given the pointer to a random node in the linked list. What is the minimum number of nodes you'd need to access twice to find the least element in the linked list?


Problem Loading...

Note Loading...

Set Loading...