CodeMosa
Master LeetCode Patterns
All Patterns
Collections
Sign In
Back
Merge & Split
Question 1 of 12
8% Complete
Hard
To merge k sorted linked lists efficiently, what data structure should you use?
A
Min heap of size k, always extract min and add its next node
B
Merge them one by one sequentially
C
Sort all nodes together
D
Use divide and conquer without extra space
Need a hint?
Think about finding the minimum among k elements repeatedly