Search⌘ K
AI Features
Home
Courses
Grokking the Coding Interview Patterns in Go

Solution: Rotate List

Understand how to rotate a singly linked list to the right by k positions efficiently using in-place manipulation. This lesson covers the algorithm to calculate list length, form a circular list, locate the new tail, and break the cycle to produce the rotated list. Learn to implement the rotation in linear time with constant space.

We'll cover the following...

Statement

You are given the head of a singly linked list and a non-negative integer k. Your task is to rotate the list to the right by k positions.

A right rotation by 1 means the last node becomes the new head, and every other node shifts one position to the right.

Return the head of the rotated linked list.

Constraints:

  • The number of nodes in the list is in the range [0, ...