Problem Statement

Given the head of a linked list and integer k, rotate the list to the right by k places.

Examples

1. Example 1:

   • Input: head = [7, 13, 1], k = 2
   • Expected Output: [13, 1, 7]
   • Justification: The list [7, 13, 1] when rotated by 2 positions to the right, the last two elements (13 and 1) move to the front, resulting in [13, 1, 7].

2. Example 2:

   • Input: head = [3, 5, 9, 12], k = 1
   • Expected Output: [12, 3, 5, 9]
   • Justification: Rotating the list [3, 5, 9, 12] by 1 position to the right, the last element (12) moves to the front of the list, giving us [12, 3, 5, 9].

3. Example 3:

   • Input: head = [22, 4, 10, 15, 29], k = 7
   • Expected Output: [15, 29, 22, 4, 10]
   • Justification: Since k is greater than the length of the list (which is 5), we effectively need to rotate the list by k % length = 2 positions to the right. Thus, the last two elements (29 and 15) move to the front, resulting in [15, 29, 22, 4, 10].

Try it yourself

Try solving this question here: