Your question is Smallest Range Across Arrays. Start with the requirements on the right.
Run and submit as often as you like. When you're ready, talk me through your approach or go straight to the code.
Minted can compare ordered sets of design scores from different collections. Given three non-empty arrays of integers, each sorted in nondecreasing order, find the smallest inclusive range that contains at least one number from every array.
Return the range as [low, high]. The range width is high - low. If multiple ranges have the same width, return the one with the smaller low value.
Implement smallest_range(arrays), where arrays is a list containing exactly three sorted integer arrays. Return a two-element list [low, high]. A valid range must satisfy that each input array contains at least one value x such that low <= x <= high.
def smallest_range(arrays):