Tap here to switch tabs
Problem
Submissions

Problem: Smallest Range Covering Elements from K Lists

Smallest Range Covering Elements from K Lists asks you to find the narrowest value interval containing at least one number from every sorted list, using the earliest start to break ties.

Statement

You are given kk sorted lists of integers, nums, where each list in nums is in non-decreasing order. Your task is to find the smallest range that contains at least one element from each of the kk lists.

A range [a,b][a,b] is considered smaller than another range [c,d][c,d] if b−a<d−cb−a<d−c, or a<ca < c if b−a==d−cb-a==d-c.

Constraints:

  • nums.length ==k== k

  • 1<=k<=1001 <= k <= 100

  • 1≤1 \leq nums[i].length ≤50\leq 50

  • −103≤-10^3 \leq nums[i][j] ≤103\leq10^3

  • nums[i] is sorted in a non-decreasing order.

⋮
Tap here to switch tabs
Problem
Submissions

Problem: Smallest Range Covering Elements from K Lists

Smallest Range Covering Elements from K Lists asks you to find the narrowest value interval containing at least one number from every sorted list, using the earliest start to break ties.

Statement

You are given kk sorted lists of integers, nums, where each list in nums is in non-decreasing order. Your task is to find the smallest range that contains at least one element from each of the kk lists.

A range [a,b][a,b] is considered smaller than another range [c,d][c,d] if b−a<d−cb−a<d−c, or a<ca < c if b−a==d−cb-a==d-c.

Constraints:

  • nums.length ==k== k

  • 1<=k<=1001 <= k <= 100

  • 1≤1 \leq nums[i].length ≤50\leq 50

  • −103≤-10^3 \leq nums[i][j] ≤103\leq10^3

  • nums[i] is sorted in a non-decreasing order.