Given the head of a singly linked list and two integers left and right where left <= right, reverse the nodes of the list from position left to position right, and return the reversed list.
Note: Positions are 1-indexed.
n1 <= n <= 500-500 <= Node.val <= 5001 <= left <= right <= nhead = [1,2,3,4,5], left = 2, right = 4[1,4,3,2,5]head = [5], left = 1, right = 1[5]