a list of disjoint sets representing learning buckets, where buckets[i] is the set of cards in the ith bucket, for all 0 <= i < buckets.length.
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
Generated using TypeDoc
Find a minimal range of bucket numbers covering a list of learning buckets.