Merge k Sorted Lists | 3 Solutions | Priority Queue

Опубликовано: 23 Май 2026
на канале: Vishal Rajput
176
4

In this video, we tackle LeetCode problem 23. Merge k Sorted Lists, providing three solutions. The first two solutions involve merging two sorted lists, and the last solution utilizes a priority queue.

Timestamps:
0:00 - Question Description
0:50 - Merging K-1 times using Merge 2 Sorted Lists
3:50 - Merging logK times using Merge 2 Sorted Lists
7:54 - Using a Priority Queue

Question Link: https://leetcode.com/problems/merge-k...
Solution Link: https://github.com/Vishal-raj-1/DSA-f...

This video is a part of the Master Linked List with Vishal Rajput Series:    • Master Linked List  

Join Telegram Community: https://t.me/vishal_rajput_1

Connect with me,
👉 Instagram:   / vishal_raj_1_  
👉 Twitter:   / vishalraj_1  
👉 LinkedIn:   / vishalraj1  
👉 GitHub: https://github.com/Vishal-raj-1

#masterLinkedList #linkedlist