#23 Merge k Sorted Lists | Top Interview Questions | Ultimate Leetcode Challenge
Merge k Sorted Lists
Subscribe to my channel --- / @codersbyyutish3249
Link to Ultimate Leetcode Challenge Playlist --- • Ultimate Leetcode Challenge
Also checkout my playlist on Coding Interview Problems --- • Coding Interview Problems for Beginners
-------------------------------------------------------------------------------------------------------------------
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.
Example 1:
Input: lists = [[1,4,5],[1,3,4],[2,6]]
Output: [1,1,2,3,4,4,5,6]
Explanation: The linked-lists are:
[
1--4--5,
1--3--4,
2--6
]
merging them into one sorted list:
1--1--2--3--4--4--5--6
Example 2:
Input: lists = []
Output: []
Example 3:
Input: lists = [[]]
Output: []
Constraints:
k == lists.length
k = [0, 10^4]
lists[i].length = [0, 500]
lists[i][j] = [-10^4, 10^4]
lists[i] is sorted in ascending order.
The sum of lists[i].length won't exceed 10^4.
Link to the problem --- https://leetcode.com/problems/merge-k...
#timeenthusiast #ultimateleetcodechallenge #topinterviewquestions #leetcode #softwareengineering #placementtest