Algorithm · Meta · Medium
Problem 1 You are given three integer arrays a, b, and c, each already sorted in non-decreasing order. Return a single array that contains every element from all three arrays, also sorted in non-decreasing order. If an element appears multiple times across the input arrays, that many copies must appear in the result. Example 1: Explanation: The values from the three arrays interleave into one sorted sequence. Example 2: Explanation: Duplicate values are kept, so all three…
Checking your access…