#1758Hard#45 in TCS's list· asked at 3 companies
Smallest Range Covering Elements from K Lists
Hosted on LeetCode
Solve it on LeetCode, track it here.
This problem's full statement lives on LeetCode. Open it in a new tab, then come back to mark it solved, add notes and keep your streak.
LeetCode Premium locked?
Most company-tagged LeetCode problems are behind Premium. If you have ChatGPT Plus or Claude Pro, ask it for the full statement, examples and constraints. The buttons below open a chat with the prompt already filled in.
What we know
Example 1
Input: nums = [[4,10,15,24,26],[0,9,12,20],[5,18,22,30]] Output: [20,24]
24 from list 1, 20 from list 2, 22 from list 3.
Example 2
Input: nums = [[1,2,3],[1,2,3],[1,2,3]] Output: [1,1]
Constraints
- •
nums.length == k - •
1 <= k <= 3500 - •
1 <= nums[i].length <= 50 - •
-10^5 <= nums[i][j] <= 10^5 - •
nums[i]is sorted in non-decreasing order.