#K57082. Count Vowels in a String
Count Vowels in a String
Count Vowels in a String
You are given a string \(s\) consisting of lowercase English letters. Your task is to count the number of vowels in \(s\). In this problem, the vowels are defined as \(\{a, e, i, o, u\}\). For each test case, compute the number of vowels present in the string.
Example: For \(s = \texttt{hello}\), the output is \(2\), since \(e\) and \(o\) are vowels.
inputFormat
The input starts with an integer \(T\) denoting the number of test cases. Each of the following \(T\) lines contains a string \(s\) consisting of lowercase English letters.
\(\textbf{Input Format:}\)
T s_1 s_2 ... s_T
outputFormat
For each test case, output a single integer representing the number of vowels in the corresponding string. Each output should be in a new line.
\(\textbf{Output Format:}\)
answer_1 answer_2 ... answer_T## sample
3
hello
world
programming
2
1
3
</p>