Search
⌘K
Get Premium
Leetcode 632. 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.
Question Timeline
See when this question was last asked and where, including any notes left by other candidates.
All Regions
Comments
Hello Interview Premium
Your account is free and you can post anonymously if you choose.