Given a string s, remove all consonants and prints the string s that contains vowels only.
Input: The first line of input contains integer T denoting the number of test cases. For each test case, we input a string.
Output: For each test case, we get a string containing only vowels. If the string doesn't contain any vowels, then print "No Vowel"
Constraints:
1<=T<=100
The string should consist of only alphabets.
Examples:
Input: geEks
Output: eE
Input: what are you doing
Output: a ae ou oi
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.
bruceewayne | 113 |
shivam123ahuja | 98 |
BoggavarapuRamSaranSaiSrinivasGupta | 98 |
rajupraaa1234 | 95 |
SUZAKU | 92 |
mr_kksparrow | 433 |
manvirag982 | 294 |
snow_den_ | 236 |
Exception_404 | 236 |
PranathiBhuvanagiri | 232 |
blackshadows | 5331 |
Ibrahim Nash | 5219 |
akhayrutdinov | 5111 |
mb1973 | 4929 |
Quandray | 4567 |