Linked ListMedium

24. Rotate Linked List by K Positions

Forms a circular list by linking tail to head, advances length - (k % length) steps, and breaks the circular link.

Time O(n) Space O(1)

Live loop — open the studio to scrub, add your own array, or race it in Battle Arena.

Asked in interviews at

GoogleAmazonNetflix

Reference implementation (Python)

def rotate_right(head, k):
    if not head or not head.next: return head
    length, tail = 1, head
    while tail.next:
        tail, length = tail.next, length + 1
    k = k % length
    if k == 0: return head
    tail.next = head # make circular
    curr = head
    for _ in range(length - k - 1):
        curr = curr.next
    new_head = curr.next
    curr.next = None
    return new_head

Embed this visualization

Drop a live, looping 24. Rotate Linked List by K Positions canvas into a blog post or course page.

<iframe src="/embed/rotate-linked-list" width="100%" height="380" style="border:1px solid #e6e8ec;border-radius:14px" loading="lazy" title="3D algorithm visualization by CodeWithMunnaX"></iframe>

Frequently asked

What is the time and space complexity of 24. Rotate Linked List by K Positions?

24. Rotate Linked List by K Positions runs in O(n) time and O(1) auxiliary space.

Is the 24. Rotate Linked List by K Positions visualizer free?

The core 3D visualizer, Web Audio chimes and step intuition are free. A one-time ₹49 Pro Pass unlocks advanced algorithms, large custom arrays, Battle Arena and reel export.

Which companies ask 24. Rotate Linked List by K Positions in interviews?

24. Rotate Linked List by K Positions shows up in interviews at Google, Amazon, Netflix.

How does the 3D visualization of 24. Rotate Linked List by K Positions work?

Each array value becomes a 3D pillar whose height maps to its value. Comparisons glow amber, swaps flash red, and settled elements lock green while a floating pointer badge tracks the active index — synchronized line-by-line with the Python code.