Available question text
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.
Related questions
Continue with questions that share topics or the same question type.
Sources · 1 reference
These records explain where the question appears. A company tag or candidate report does not guarantee a future interview question.
Hello Interview · 1 record
No company association
Leetcode 2350. Shortest Impossible Sequence of Rolls
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source