Circular linked list

is this possible that the link list which is required is sorted and the point from which cycle is made is less then the previous node so we just compare that and get the result

No sir @Learning_bunny
just the test case is so that it is given in increasing order
that u can make out this logic for
the linked list element can be of any sequence may not always be sorted

u should read about detecing loop in linked list
and how to break it
it is covered in a video by Prateek bhaiya refer that