Interview Questions – Merge K sorted lists efficiently
Problem Given K sorted arrays write an efficient algorithm to merge them into one. Example Given the below sorted array where K = 3 k1 : 4 5 6 k2 : 1 2 3 k3 : 8 9 10 output sorted list : 1 2 3 4 5 6 8 9 10 Constraints [1] 1…