CodeOath
← All problems

Merge Two Sorted Lists

Easy
linked-list

Merge two sorted linked lists and return the head of the merged, still-sorted list, splicing together the nodes of the two lists.

Lists in this problem are given and returned as a plain array of values, in order.

Example:

Input: l1 = [1,2,4], l2 = [1,3,4]
Output: [1,1,2,3,4,4]