Available question text
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.
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 1641. Count Sorted Vowel Strings
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source