Back to problems

Merge Three Sorted Arrays with Deduplication

Algorithm · Amazon · Medium

Merge Three Sorted Arrays Without Duplicates Easy · Topics · Company Tags · Hints You are given three integer arrays a, b, and c. Each array is already sorted in non-decreasing order. Return a single sorted integer array that contains every value appearing in at least one of the input arrays. Each value must appear only once in the output, even if it occurs multiple times across the inputs. Do not solve this by concatenating the arrays and then sorting the combined list. One…

Checking your access…