You are given an array of strings words and a list of range queries queries. Each query is a pair of indices [l_i, r_i] that refers to the subarray words[l_i..r_i] (inclusive).

For each query, return how many strings in the specified range both start and end with a vowel. Vowels are the lowercase letters a, e, i, o, and u.

Return an array of answers in the same order as queries.

Constraints:

• $1 \leq$ words.length $\leq 10^5$

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

• words[i] consists only of lowercase English letters

• $\sum$(words[i].length) $\leq 3 \cdot 10^5$

• $1 \leq$ queries.length $\leq 10^5$

• $0 \leq$ l_i $\leq$ r_i $<$ 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.