Your Dashboard
Interview Coaching
Learn
System Design
ML System Design
Code
Behavioral
Salary Negotiation
Interview Guides
Search
⌘K
Get Premium
Leetcode 1220. Count Vowels Permutation
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).
Question Timeline
See when this question was last asked and where, including any notes left by other candidates.
All Regions
Comments
Hello Interview Premium
Your account is free and you can post anonymously if you choose.