Merge Two Sorted Lists

Merge two sorted linked lists and return it as a sorted list.

LeetCode: Merge Two Sorted Lists

Example:

Input: list1 = [1,2,4], list2 = [1,3,4]
Output: [1,1,2,3,4,4]

Hints

Hint 1

Use a dummy node to simplify the logic. This avoids having to handle the head separately.

Hint 2

Compare the values at the current positions of both lists. Attach the smaller node to your result list.

Hint 3

Don't forget to attach any remaining nodes from either list after one list is exhausted.