easy Linked Lists 15 points

Merge Two Sorted Lists

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

Problem Description

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

Examples

Example

Input: [1,2,4], [1,3,4]

Output: [1,1,2,3,4,4]

Challenge Info

15 Points

Reward

easy

Difficulty

No limit

Time Limit

Submission Stats

Total Submissions 0
Accepted 55
Success Rate 0%