How should I practice Merge Three Sorted Arrays?

Start by reading the full statement, solve the visible examples, then compare the pattern against related Meta online assessment problems in FastPrep.

Is Merge Three Sorted Arrays associated with Meta?

FastPrep tags this as a Meta coding interview or online assessment practice problem when the problem catalog has that company context.

Problem · Array

Merge Three Sorted Arrays

Learn this problem

● EasyMetaFULLTIMEPHONE SCREEN

See Meta hiring insights

Problem statement

You are given three integer arrays that are each sorted in non-decreasing order.

Merge the arrays into one sorted array and remove duplicate values. Return the merged array in non-decreasing order.

Function

mergeThreeSortedArrays(a: int[], b: int[], c: int[]) → int[]

Complete the function mergeThreeSortedArrays in the editor.

mergeThreeSortedArrays has the following parameters:

int a[]: the first sorted array
int b[]: the second sorted array
int c[]: the third sorted array

Returns

int[]: the sorted merged array with duplicates removed

Examples

Example 1

a = [1, 3, 5]b = [1, 2, 5, 6]c = [2, 4, 6]return = [1, 2, 3, 4, 5, 6]

After merging all values and removing duplicates, the sorted result is [1, 2, 3, 4, 5, 6].

Example 2

a = []b = [0, 0, 1]c = [1, 2]return = [0, 1, 2]

Empty arrays are allowed. Duplicate 0 and 1 values are returned once.

Constraints

Each input array is sorted in non-decreasing order.
The arrays may contain duplicate values.
The arrays may be empty.