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.
Question Timeline
See when this question was last asked and where, including any notes left by other candidates.
All Regions
Your account is free and you can post anonymously if you choose.