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, 500].

• $-100 \leq$ Node.val $\leq 100$

• $0 \leq$ k $\leq 2 \times 10^9$

Let’s take a moment to make sure you’ve correctly understood the problem. The quiz below helps you check if you’re solving the correct problem:

We have a game for you to play. Rearrange the logical building blocks to develop a clearer understanding of how to solve this problem.

Implement your solution in the following coding playground.