Problem Submissions Solution

Merge Two Sorted Lists

Difficulty: Medium

Acceptance: %

Points: 30.00

Given two sorted linked lists consisting of nodes respectively. The task is to merge both lists and return the head of the merged list.


Topics

Companies

Articles

Examples:

Expected Time Complexity: O(n+m)

Expected Auxilliary Space: O(1)

Constraints:
  • 1 <= no. of nodes<= 10^5
  • 0 <= node->data <= 10^5
Companies:
Amazon Microsoft Samsung Oracle Flipkart + 1 more
Topics:
Linked List
Locked Content
Access Restricted: Please Login to access the code editor and test cases.