Given a string word and a non-negative integer k, return the total count of substrings of word that contain every vowel ($'a'$, $'e'$, $'i'$, $'o'$, and $'u'$) at least once and contain exactly k consonants.

Constraints:

• $5 \leq$ word.length $\leq 250$

• word consists only of lowercase English letters.

• $0 \leq$ k $\leq$ word.length $- 5$

Now, let’s take a moment to make sure you’ve correctly understood the problem. The quiz below helps you check if you’re solving the correct problem:

We have a game for you to play. Rearrange the logical building blocks to develop a clearer understanding of how to solve this problem.

Implement your solution in the following coding playground.