Swap Nodes in Pairs

You are given the head of a singly linked list. Your task is to swap every two adjacent nodes without modifying the values stored in the nodes and return the head of the modified list. If the linked list contains an odd number of nodes, the last node remains unchanged.

Please log in to access the Submissions tab, where you can review your progress and explore code submissions from other participants.

Please log in to access the Solution tab and view detailed answers and explanations.

Please log in to access the Discussion tab and join conversations with other participants.