Delete Nth Node From Last In Linked List

[@alexandresendra]

Not sure I get it. If we have A->B->C->D And I want to delete 2nd form the end, that's C. That means with your algorithm, fast will go forward 2 times, that means from A to C. But than fast is not null so you return head->next. I don't understand

[@saj-qh6qk]

Amazing explanation.