Circling on and on
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?
The answer is 0.
This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try
refreshing the page, (b) enabling javascript if it is disabled on your browser and,
finally, (c)
loading the
non-javascript version of this page
. We're sorry about the hassle.
0 solutions
No explanations have been posted yet. Check back later!