Grokking the Coding Interview Patterns in Python/

...

/

Solution: Remove Nth Node from End of List

Solution: Remove Nth Node from End of List

Let's solve the Remove Nth Node from End of List problem using the Two Pointers pattern.

We'll cover the following...

Statement

Given the head of a singly linked list, remove the nthn^{th} node from the end of the list and return its head.

Constraints:

  • The number of nodes in the list is k.
  • 1≤1 \leq k ≤103\leq 10^3
  • −103≤-10^3 \le Node.data ≤103\le 10^3
  • 1≤1 \le n ≤\le k
Access this course and 1400+ top-rated courses and projects.