Given a String of length N reverse each word in it. Words are separated by dots.
Input:
The first line contains T denoting the number of testcases. Then follows description of testcases. Each case contains a string containing dots and characters.
Output:
For each test case, output a String in single line containing the reversed words of the given String.
Constraints:
1<=T<=10
1<=Length of String<=2000
Example:
Input:
2
i.like.this.program.very.much
pqr.mno
Output:
i.ekil.siht.margorp.yrev.hcum
rqp.onm
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.
| op_manish | 189 |
| ArpitGupta8 | 163 |
| lone_walker | 160 |
| Prince_Singh | 154 |
| KshamaGupta | 154 |
| saiujwal13083 | 728 |
| ppsvikhyat17 | 712 |
| generic_coder | 630 |
| reclone_rk | 479 |
| vt9941 | 479 |
| blackshadows | 5448 |
| Ibrahim Nash | 5438 |
| akhayrutdinov | 5111 |
| mb1973 | 4976 |
| Quandray | 4752 |