Remove Nth Node From End of List

IF
AlgoAxiomStaff Engineers
JSTS
Medium20 mins

Given the head of a linked list, remove the nth node from the end of the list and return its head.

Examples

Example 1:

Input: head = [1,2,3,4,5], n = 2

Output: [1,2,3,5]

Explanation: The 2nd node from the end is 4. After removing it, the list becomes [1,2,3,5].

Example 2:

Input: head = [1], n = 1

Output: []

Explanation: The only node is removed, resulting in an empty list.

Example 3:

Input: head = [1,2], n = 1

Output: [1]

Explanation: The last node is removed, leaving [1].

Constraints

  • The number of nodes in the list is sz
  • 1 <= sz <= 30
  • 0 <= Node.val <= 100
  • 1 <= n <= sz
Source: Fast and Slow Pointers pattern — AlgoAxiom
JavaScript
Test Case 1
root = [1, 2, 3]
Test Case 2
root = [1, 2, 3, 4, 5]
Idle