Workspace

Problem workspace

3 day streakD

Remove Duplicates from a Sorted List

EasyLinked ListsBasics

The challenge

Remove repeated values from a sorted list, keeping the first node of each value.

Sorted nondecreasing input. This keeps one copy; it does not remove every value that appeared more than once.

Example

[1, 1, 2, 3, 3] → [1, 2, 3].

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

See Remove duplicates, step by step

Follow the pointers. Watch each link change.

5 nodes · singly linkedIDs = node identity · ∅ = null
Repeated runs: 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.head1A11A22A33A43A5∅
CurrentResultYellow arrow: changed next link
headA1
Inspect node links
Each row is a distinct node object. D is the dummy sentinel.
NodeValueNext
A11A2
A21A3
A32A4
A43A5
A53null
Step 01 / 6

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) → 1 (A2) → 2 (A3) → 3 (A4) → 3 (A5); parameters: {}

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

Sorted order puts every duplicate beside the node that should survive.

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 deduplicate(head):
    curr = head
    while curr and curr.next:
        if curr.val == curr.next.val:
            curr.next = curr.next.next
        else:
            curr = curr.next
    return head

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