Merge N sorted lists into one sorted list
Given N lists sorted in non-decreasing order, merge them into one sorted list.
Example
lists = [[1,4,5],[1,3,4],[2,6]]- Output:
[1,1,2,3,4,4,5,6]
Assumed constraints
- `1 <= N <= 1e...
Example
Unlock to view complete problem details
and practice with sample input/output
Was this article helpful?
View Test Cases & Run Code requires membership
Standard Input
Execution Result:
