EmbeddedInterviewLab
Topics
Interview
Coding
Toggle menu
Start Learning
All Problems
Merge Two Sorted Lists
Easy
•
linked-list
•
Expected: O(n+m) time, O(1) space
•
Interview Context
sorting
Problem
Given the heads of two sorted linked lists, merge them into one sorted linked list.
Show Reference Solution
Language:
C++
C
Submit
Loading...