# Problem Definition

## 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:**

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

## Notes

1. [LeetCode discussion - Java, 1 ms, 4 lines codes, using recursion](https://leetcode.com/explore/interview/card/top-interview-questions-easy/93/linked-list/771/discuss/9715/Java-1-ms-4-lines-codes-using-recursion)
1. [LeetCode discussion - Java solution with real world concerns #real-world-concerns](https://leetcode.com/problems/merge-two-sorted-lists/discuss/9772/java-solution-with-real-world-concerns-real-world-concerns)