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.
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
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.