Leetcode 2350. Shortest Impossible Sequence of Rolls

Given a sequence of k-sided dice rolls, find the smallest length L such that some length-L sequence of faces cannot be formed as a (not-necessarily-contiguous) subsequence of the rolls. Core challenge: determine how many complete collections of all k faces can be extracted sequentially from rolls — the answer is that count + 1.