Merge Two Sorted Lists at Apple

Easy68.0% acceptance

This problem has 62.2% frequency at Apple.

Problem Description

You are given the heads of two sorted linked lists `list1` and `list2`. Merge the two lists into one **sorted** list. The list should be made by splicing together the nodes of the first two lists. Return _the head of the merged linked list_.

Read full problem and hints

Topics

Also asked at 40 companies


More Apple Questions

View all Apple questions