Workspace

Problem workspace

3 day streakD

Remove the Nth Node from the End

MediumLinked ListsFast & slow pointers

The challenge

Remove the nth node from the end and return the new head.

n is one-based. If n ≤ 0 or n exceeds the list length, leave the list unchanged.

Example

[1, 2, 3, 4, 5], n = 2 → [1, 2, 3, 5].

Use the walkthrough below to inspect the input and each state change.

See Remove nth from end, step by step

Follow the pointers. Watch each link change.

5 nodes · singly linkedIDs = node identity · ∅ = null
Remove second from end: Read the inputIDs label node objects. Equal values can belong to different nodes. Solid arrows are next links; dashed arrows are random links. Node positions stay fixed while arrows change. The pointer strip and node table below give the same state in text.head1A12A23A34A45A5∅
CurrentResultYellow arrow: changed next link
headA1
Inspect node links
Each row is a distinct node object. D is the dummy sentinel.
NodeValueNext
A11A2
A22A3
A33A4
A44A5
A55null
Step 01 / 8

Read the input

IDs label node objects. Equal values can belong to different nodes. Solid arrows are next links; dashed arrows are random links.

Start from the input head pointers.
View original input

A: 1 (A1) → 2 (A2) → 3 (A3) → 4 (A4) → 5 (A5); parameters: {"n":2}

Parameter indices are zero-based, except n from the end, which is one-based. Node IDs remain fixed when links change.

Put it into code

With a dummy head, a gap of n nodes puts slow just before the node to remove.

Node stores val and next; the random-pointer lesson adds random. C++ uses C++17 or later.

class Node:
    def __init__(self, val=0, next=None):
        self.val = val
        self.next = next


def remove_nth(head, n):
    if n <= 0:
        return head
    dummy = Node(next=head)
    slow = fast = dummy
    for _ in range(n):
        fast = fast.next
        if fast is None:
            return head
    while fast.next:
        slow, fast = slow.next, fast.next
    slow.next = slow.next.next
    return dummy.next

A good place to start

Explore a pattern

A little guidance

Start with a pattern, read through a problem, and mark it solved when the idea clicks. Save anything you want to revisit.

New tutorials are added one at a time. Your bookmarks and solved checkmarks stay in this browser.

Explore the roadmap