Available question text
Count the number of length-n sequences of 6-sided die rolls where face i cannot appear more than rollMax[i] consecutive times, returning the result modulo 1e9+7; with n up to 5000 and rollMax[i] ≤ 15 this requires dynamic programming over positions and run-lengths rather than brute force.
Related questions
Continue with questions that share topics or the same question type.
- Alt and Tab Simulation
Coding
- Banking System Simulation
Coding · Data Structure Design · Simulation & State Machines
- Implement Kac Ring Simulation with O(1) Step Query
Coding
- Infection Spread Simulation with Death Threshold
Coding · Simulation & State Machines
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 1223. Dice Roll Simulation
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source