Swap Nodes in Pairs at Microsoft

Problem Description

Given a linked list, swap every two adjacent nodes and return its head. You must solve the problem without modifying the values in the list's nodes (i.e., only nodes themselves may be changed.)

Topics

Also asked at 15 companies