Available question text
Count the number of length-n vowel strings that correspond to walks of length n−1 in a fixed directed graph of 5 states given by the follow-rules, returning the result modulo 10^9+7. This is a 5-state linear recurrence counting walks (solvable with simple DP or matrix exponentiation).
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 1220. Count Vowels Permutation
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source