Solving Swap Nodes in Pairs in go. Please try yourself first to solve the problem and submit your implementation to LeetCode before looking into solution.

Problem Description

Given a linked list, swap every two adjacent nodes and return its head.

You may not modify the values in the list's nodes, only nodes itself may be changed.

Example:

Given 1->2->3->4, you should return the list as 2->1->4->3.

See the full details of the problem Swap Nodes in Pairs at LeetCode

Originally posted at: @github.com/halfrost/LeetCode-Go