Smallest Range Covering Elements from K Lists

Find the smallest interval [a, b] (minimize length, tie-break by smaller a) that contains at least one number from each of k sorted arrays. The core challenge is coordinating elements across lists—typically solved with a k-way merge/min-heap while tracking the current maximum or by sliding a window on the merged list.