You are given a $0$ indexed array of strings words and two integers left and right.

A string is defined as a vowel string if it starts with a vowel character and ends with a vowel character, where the vowel characters are 'a', 'e', 'i', 'o', and 'u'.

Return the count of vowel strings words[i] where i lies in the inclusive range $[$left, right$]$.

Constraints:

• $1 \leq$ words.length $\leq 1000$

• $1 \leq$ words[i].length $\leq 10$

• words[i] consists of only lowercase English letters.

• $0 \leq$ left $\leq$ right $<$ words.length

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.