For a given string S, comprising of only lowercase English alphabets, eliminate the vowels from the string that occur between two consonants(sandwiched between two immediately adjacent consonants). Print the updated string on a new line.
First line of input is an integer T, denoting the number of test cases. For each test case, input the string S on a new line.
For each test case, the only line of output is the updated string after omission of all sandwiched vowels.
3<=L<=10, where L is length of string S
'a'<=S[i]<='z', i is an integer denoting index of S
In the first test case, a is a vowel occuring between two consonants i.e. b. Hence the updated string eliminates a.
In the second test case, e and i are the vowels occurring between tow consonants. Hence they are removed from the string.
In the third and fourth test cases, there is no such vowel that occurs between two consonants. Hence the string remains unchanged.
In the fifth test case, o occurs between f and r which are consonants, hence is eliminated.
If you have purchased any course from GeeksforGeeks then please ask your doubt on course discussion forum. You will get quick replies from GFG Moderators there.