Rotate List
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
0 <= number of nodes <= 100-100 <= Node.val <= 1000 <= k <= 200
Write it in your browser, against the clock. The model solution, stepped through line by line, comes after.
More Linked lists problems
- Sort ListMedium
- Split Linked List in PartsMedium
- Swap Kth From Start and EndMedium
- Where the Cycle StartsMedium
- Complete the MirrorHard
- Deal and WeaveHard
- Fold Many TimesHard
- Multiply Two NumbersHard