Skip to main content

Questions Categories Patterns Progress

CodeTutor - Coding Interview Preparation

Remove Nth Node From End of List | CodeTutor

Remove Nth Node From End of List

Medium

Linked Lists Two Pointers Two Pointers Fast & Slow Pointers

Problem

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

Constraints

The number of nodes in the list is sz
1 <= sz <= 30
0 <= Node.val <= 100
1 <= n <= sz

Examples

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

Output: [1,2,3,5]

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

Input: head = [1], n = 1

Output: []

The list has only one node, and we remove it. The result is an empty list.

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

Output: [1]

The 1st node from the end is 2. After removing it, the list becomes [1].

Loading...

Loading Python...