← Questions
Nth node from the end of a linked list
0
I was asked this
No reports yet. Sign in to say where you were asked it.
Return (or remove) the n-th node from the end of a singly linked list in one pass, moving a lead pointer n steps ahead of a trailing one.
No official answer yet. Write yours on the right and run it.
Nothing published yet.
Sign in to submit your code; every attempt is kept here.
Write and test your solution herePython in your browser, the question's tests level by level, every submission kept for you.Sign in to start coding