Talk:The Haruhi Problem/@comment-36964662-20181024143823

This problem was already solved, look up de Bruijn sequences on wikipedia (https://en.wikipedia.org/wiki/De_Bruijn_sequence). It is a sequence generated from all possible permutations of a given alphabet, rearanged to be optimally short, exactly the asumptions made in this problem.