Count valid vowel sequences under constraints
Filed under Gameskraft
The question
Find the count of all possible strings of length l containing only vowels that follow specific sequencing rules (e.g., 'a' can only be preceded by 'e', 'u', 'i'), reporting the result modulo 10^9+7.
No write-up yet. Related questions below have one.
Related Gameskraft questions
Collected from public candidate posts and coding forums. Updated Nov 2026.