Remove Nth Node From End of List — Medium Coding Interview Question

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

Example

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

Output: [1,2,3,5]

Constraints

• The number of nodes is in the range [1, 30]
• 0 ≤ Node.val ≤ 100
• 1 ≤ n ≤ size of the list

Topics & Companies

Topics: linked-list, two-pointers

Asked by: Amazon, Google, Meta, Microsoft, Apple

Optimal Solution Complexity

Time complexity: O(n). Space complexity: O(1).

Practice more

• All DSA Problems
• DSA Patterns