#253 · #3306 · Count of Substrings Containing Every Vowel and K Consonants II(元音辅音字符串计数 II)

You are given a string word and a non-negative integer k. Return the number of substrings that contain every vowel (a, e, i, o, u) at least once and exactly k consonants. Constraints: 5 <= word.length <= 2 * 10^5, 0 <= k <= word.length - 5; word consists of lowercase English letters and digits.