Swap Nodes in Pairs at Qualcomm
Medium68.9% acceptance
This problem has 62.5% frequency at Qualcomm.
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.)
Read full problem and hintsTopics
Also asked at 15 companies
More Qualcomm Questions
Reverse Linked ListEasyPower of TwoEasyMiddle of the Linked ListEasyRemove Nth Node From End of ListMediumLRU CacheMedium
View all Qualcomm questions