i saw the algorithm to remove the cycle but i am not able to understand that when i get slow==fast then from that how will i know hoe many steps i have to go to find the start of the cycle.
How to remove the cycle
Hello @Abhay-Chauhan-1546158815521966 the step when you are checking slow==fast then here we are checking that there is cycle in the linked list.
then we have to check that at what point there is cycle by running the both the linked list with the condition that slow->next!=null and fast->next!=null we will check on pointers and when we will found cycle means that cindition becomes true then we will attach false after fast->next;
if you have any other doubt you can ask here;
Happy Learning!!
I hope I’ve cleared your doubt. I ask you to please rate your experience here
Your feedback is very important. It helps us improve our platform and hence provide you
the learning experience you deserve.
On the off chance, you still have some questions or not find the answers satisfactory, you may reopen
the doubt.