FunctionRacerProblemsRace

Rotate List

MediumLinked listsPython, JavaScript, TypeScript, Java, C++

Rotate the list to the right by k places: each step moves the last node to the front. k can be larger than the length of the list. Return the new head. The list is passed in as head.

Linked lists appear in the tests as the list of their values, like [1,2,3]. Each node is a ListNode with .val and .next; the class is already defined for you.

Example 1

head [1,2,3,4,5]
k 2
returns [4,5,1,2,3]

Two steps: 5,1,2,3,4 then 4,5,1,2,3.

Example 2

head [1,2]
k 4
returns [1,2]

Four steps on two nodes is the same as none.

Constraints

Race itor take your time

Write it in your browser, against the clock. The model solution, stepped through line by line, comes after.

More Linked lists problems