Merge Sorted Lists With Dedup | Dataford Interview Questions

Write a program to merge two sorted linked lists, remove any duplicate elements, and return the sorted result.

Assume each list is represented by a ListNode with val and next, and return the head of a linked list containing each value once.

For example, [1, 2, 4] and [1, 3, 4] produce [1, 2, 3, 4]; inputs may be empty and contain negative or repeated values.

Each input list is sorted in nondecreasing order.
0 <= length(head1), length(head2) <= 300
-10^9 <= node.val <= 10^9
The input lists may contain repeated values.
The returned list must be sorted in nondecreasing order with no duplicate values.

def merge_unique_lists(head1, head2):

Your question is Merge Sorted Lists With Dedup. Start with the requirements in the Question tab.

Run and submit as often as you like. When you're ready, talk me through your approach or go straight to the code.

Write a program to merge two sorted linked lists, remove any duplicate elements, and return the sorted result.

Assume each list is represented by a ListNode with val and next, and return the head of a linked list containing each value once.

For example, [1, 2, 4] and [1, 3, 4] produce [1, 2, 3, 4]; inputs may be empty and contain negative or repeated values.

Each input list is sorted in nondecreasing order.
0 <= length(head1), length(head2) <= 300
-10^9 <= node.val <= 10^9
The input lists may contain repeated values.
The returned list must be sorted in nondecreasing order with no duplicate values.

def merge_unique_lists(head1, head2):

Your question is Merge Sorted Lists With Dedup. Start with the requirements in the Question tab.

Run and submit as often as you like. When you're ready, talk me through your approach or go straight to the code.