Workspace

Problem workspace

3 day streakD

Rotate a Linked List

MediumLinked ListsReversal

The challenge

Rotate a list to the right by k positions and return its new head.

k is a nonnegative integer; an empty list remains empty.

Example

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

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

See Rotate right, step by step

Follow the pointers. Watch each link change.

5 nodes · singly linkedIDs = node identity · ∅ = null
Rotate right by two: 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 / 10

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: {"k":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

Only k modulo length matters. The new tail is length − k − 1 steps from head.

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 rotate_right(head, k):
    if head is None or head.next is None:
        return head
    tail, length = head, 1
    while tail.next:
        tail = tail.next
        length += 1
    k %= length
    if k == 0:
        return head
    tail.next = head
    new_tail = head
    for _ in range(length - k - 1):
        new_tail = new_tail.next
    new_head = new_tail.next
    new_tail.next = None
    return new_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