Use a dummy node to handle edge cases where the sublist starts at the head of the list.

Traverse the list to find the node just before the left position and the node at the right position, storing references to these nodes for later reconnection.

Reverse the sublist in-place by iteratively adjusting pointers, then reattach the reversed sublist back into the original list by linking the stored nodes.