Merge Two Sorted Linked Lists

You are given the heads of two singly linked lists sorted in non-decreasing order. Your task is to merge them into a single sorted linked list and return the head of the merged list.

Please log in to access the Submissions tab, where you can review your progress and explore code submissions from other participants.

Please log in to access the Solution tab and view detailed answers and explanations.

Please log in to access the Discussion tab and join conversations with other participants.