FunctionRacerProblemsRace

Remove Nth Node From End of List

MediumLinked listsPython, JavaScript, TypeScript, Java, C++

Remove the n-th node counted from the end of the list (n = 1 is the last node) and return the head. n is never larger than the length of the list. The list is passed in as head.

Linked lists appear in the tests as the list of their values, like [1,2,3]. Each node is a ListNode with .val and .next; the class is already defined for you.

Example 1

head [1,2,3,4,5]
n 2
returns [1,2,3,5]

The 2nd from the end is 4.

Example 2

head [9]
n 1
returns []

The list becomes empty.

Constraints

Race itor take your time

Write it in your browser, against the clock. The model solution, stepped through line by line, comes after.

More Linked lists problems