Find a minimal range of bucket numbers covering a list of learning buckets.
Returns
a pair of integers [low, high], 0 <= low <= high, such that every
card in buckets has an integer bucket number in the range [low...high]
inclusive, and high - low is as small as possible
Find a minimal range of bucket numbers covering a list of learning buckets.
Returns
a pair of integers [low, high], 0 <= low <= high, such that every card in buckets has an integer bucket number in the range [low...high] inclusive, and high - low is as small as possible