Back

Sunday common C++ interview problem: Smallest interval to cover k sorted sequences.

Given k sequences of sorted integers, determine the smallest closed interval that covers at least one element from each sequence. For intervals of the same size should be ordered based on their lower bound value (i.e. [0,2]<[1,3]).

Solve it yourself: https://compiler-explorer.com/z/cqKo5WeMY
Solution: https://compiler-explorer.com/z/eeTMcbzP6