83. Rotate a Linked List to the Right
MediumLinked lists
Rotate a linked list to the right by k places: each rotation moves the last node to the front. Return the new head. k may be larger than the length of the list.
A linked list is passed as ListNode objects with val and next. The tests write lists as arrays.
Example 1
Input: head = [1, 2, 3, 4, 5], k = 2 Output: [4, 5, 1, 2, 3]
Example 2
Input: head = [0, 1, 2], k = 4 Output: [2, 0, 1]
Constraints
0 ≤ nodes ≤ 5000 ≤ k ≤ 2 · 10⁹