InterviewBit Academy is now Scaler!
Learn Tech Skills from Scratch @ Scaler EDGE

Merge K sorted arrays!


Problem Description

You are given K sorted integer arrays in a form of 2D integer matrix A of size K X N.

You need to merge them into a single array and return it.



Problem Constraints

1 <= K, N <= 103

0 <= A[i][j] <= 108

A[i][j] <= A[i][j+1]



Input Format

First and only argument is an 2D integer matrix A.



Output Format

Return a integer array denoting the merged array you get after merging all the arrays in A.



Example Input

Input 1:

 A = [  [1, 2, 3]
        [2, 4, 6]
        [0, 9, 10]
     ]


Example Output

Output 1:

 [0, 1, 2, 2, 3, 4, 6, 9, 10]


Example Explanation

Explanation 1:

 You need to merge [1, 2, 3] , [2, 4, 6] and [0, 9, 10]  into a single array
 so the merged array will look like [0, 1, 2, 2, 3, 4, 6, 9, 10]


NOTE: You only need to implement the given function. Do not read input, instead use the arguments to the function. Do not print the output, instead return values as specified. Still have a doubt? Checkout Sample Codes for more details.
Start solving Merge K sorted arrays! on Interview Code Editor
Sign Up
to access hints and editorial solutions for Merge K sorted arrays!
Asked In:

Discussion


Loading...
Click here to start solving coding interview questions