Leetcode 3305. Count of Substrings Containing Every Vowel and K Consonants I

Count the number of substrings of a lowercase string that contain each of the five vowels (a, e, i, o, u) at least once and contain exactly k consonants. With word length ≤ 250, this is essentially a substring-counting problem where you must track vowel coverage and consonant count (feasible with quadratic or sliding-window enumeration).

Question Timeline

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

Company

Level

Region

Comments

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

Hello Interview Premium

Recent interview questions

System Design Guided Practice

Exclusive content

Learn More

Leetcode 3305. Count of Substrings Containing Every Vowel and K Consonants I

Question Timeline

Comments

Questions

Learn

Links

Legal

Contact