Skip to content

problem12.md

Latest commit

 

History

History
11 lines (8 loc) · 381 Bytes

problem12.md

File metadata and controls

11 lines (8 loc) · 381 Bytes

Problem 12: Stream Integration

Problem Statement

You are given an array of k linked-lists lists, each linked-list is sorted in ascending order. Merge all the linked-lists into one sorted linked-list and return it.

Input Format

  • An array of k sorted linked lists.

Example

Input: lists = [[1, 4, 5], [1, 3, 4], [2, 6]]
Output: [1, 1, 2, 3, 4, 4, 5, 6]