Your Dashboard
Interview Coaching
Learn
System Design
ML System Design
Code
Behavioral
Salary Negotiation
Interview Guides
Search
⌘K
Get Premium
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.
All Regions
Comments
Hello Interview Premium
Your account is free and you can post anonymously if you choose.