Remove nth Node from End of List

Try to solve the Remove nth Node From End of List problem.

We'll cover the following

Statement

Given 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.value ≤103\le 10^3
  • 1≤1 \le n ≤\le k

Examples

Create a free account to view this lesson.

By signing up, you agree to Educative's Terms of Service and Privacy Policy