Merge Sorted Arrays with Duplicates | Dataford Interview Questions

Merge two sorted integer arrays, remove duplicates.

Asked in the Phone screen stage.

Implement a function that takes two sorted integer arrays and returns a new sorted array containing every distinct value that appears in either input. Preserve ascending order and include each value only once.

Function input: two sorted lists of integers. Function output: one sorted list of unique integers.

Constraints

Each input array is sorted in non-decreasing order
0 <= len(nums1), len(nums2) <= 10^5
-10^9 <= nums1[i], nums2[i] <= 10^9

Function Signature

def merge_unique_sorted_arrays(nums1, nums2):

Your question is Merge Sorted Arrays with Duplicates. 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.

Problem