Sort K arrays

Hard

Given an array of k sorted arrays of numbers, return a single sorted array containing all numbers from the k arrays.

For example, if k = 3 with the following input array:

arrs = [ [2, 3, 7], [-3, -2, 6], [4, 5, 9] ]

Your function should return:

[ -3, -2, 2, 3, 4, 5, 6, 7, 9 ]

Note that the input arrays could be different sizes.

def sort_arrays(arrs: list[list[int]]) -> list[int]:
    # implement sort_arrays
    return []

1def sort_arrays(arrs: list[list[int]]) -> list[int]:
2    # implement sort_arrays
3    return []
4

Solution

Master Trees & Graphs by trying the coding challenges below.

Stack Bash helps new and veteran software engineers master data structures and algorithms for technical interviews.