Suppose you are given two circularly linked lists, L andM. Describe an algorithmfor telling if L and M store the same sequence of elements (but perhaps with different starting points).
Sorry the answer is not available at the moment…
If you are able to find the answer, please make sure to post it here. So that your Juniors have smile on their lips and feel happy.
Spread the 'tradition of sharing'.