Smallest Range Covering Elements from K Sorted Lists
Given k integer lists nums, each sorted in non-decreasing order, find the smallest closed range [a, b] such that each list contributes at least one element within the range.
If multiple ran...
Example
Unlock to view complete problem details
and practice with sample input/output
Was this article helpful?
View Test Cases & Run Code requires membership
Standard Input
Execution Result: