Search
⌘K

Leetcode 1641. Count Sorted Vowel Strings

Count how many length-n strings over the vowels {a,e,i,o,u} are non-decreasing (lexicographically sorted); this is equivalent to counting combinations with repetition (stars-and-bars), yielding C(n+4,4) and computable via DP or combinatorics.


Question Timeline

See when this question was last asked and where, including any notes left by other candidates.

Comments

Your account is free and you can post anonymously if you choose.