Given a singly linked list with $n$ nodes and two positions, left and right, the objective is to reverse the nodes of the list from left to right. Return the modified list.

Constraints:

• $1 \leq$ n $\leq 500$
• $-5000 \leq$ node.value $\leq 5000$
• $1 \leq$ left $\leq$ right $\leq$ n

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.