Cycle detection and removal in linked list

#1

how to give input and my code is not passing all the test cases

#2
#3

Modified code

you have to add some corner case conditions
like

// if list is empty or only contain single element
if( head == NULL || head->next == NULL){
        return false;
    }

// when complete list is in loop 
// means last element of list points to first element
if(slow->next == head){
            fast->next = NULL;
            return true;
        }

you can see all changes in modified Code

Now this code passing all testcases

#4

what does & gt means

#5

???
what you want to ask?

#6

what does this means (head->next == NULL) is it means head->next==NULL

#7

sorry i got the point

#8

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.

#9

plz give your valuable feedback (rate your experience)

it’s important