Solving Merge Two Sorted Lists in go. Please try yourself first to solve the problem and submit your implementation to LeetCode before looking into solution.

Problem Description

Merge two sorted linked lists and return it as a new list. The new list should be made by splicing together the nodes of the first two lists.

Example :

Input: 1->2->4, 1->3->4
Output: 1->1->2->3->4->4

See the full details of the problem Merge Two Sorted Lists at LeetCode

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