3306 Count of Substrings Containing Every Vowel and K Consonants II

3306 Count of Substrings Containing Every Vowel and K Consonants II. This Java code counts the number of substrings
in a given string word that contain at most k consonants.
Key Components:
Character Mapping: It uses a byte array vow to map vowels ('a', 'e', 'i', 'o', 'u') to indices 0-4 and consonants to index 5.
setType Method: Initializes the vow array to categorize characters as either vowels or consonants.
lessEq Method: This private method computes the number of valid substrings with at most k consonants using a sliding window technique:
It maintains the last positions of vowels and their frequencies.
It adjusts the window size to ensure the number of consonants does not exceed k.
If all five vowels are present, it counts valid substrings.
countOfSubstrings Method: This public method calls lessEq to calculate the count of substrings with exactly
k consonants by using the inclusion-exclusion principle. Overall, the code efficiently counts substrings based
on vowel and consonant constraints using a two-pointer approach.

Видео 3306 Count of Substrings Containing Every Vowel and K Consonants II канала Fogy Free