Given a String of length S, reverse the whole string without reversing the individual words in it. Words are separated by dots.
Input:
The first line contains T denoting the number of testcases. T testcases follow. Each case contains a string S containing characters.
Output:
For each test case, in a new line, output a single line containing the reversed String.
Constraints:
1 <= T <= 100
1 <= |S| <= 2000
Example:
Input:
2
i.like.this.program.very.much
pqr.mno
Output:
much.very.program.this.like.i
mno.pqr
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.
| SumitSingh27 | 72 |
| SanketAgarwal1 | 54 |
| rathiarpit29 | 52 |
| ujjwalsoni1999 | 52 |
| vishalkumar61 | 50 |
| SumitSingh27 | 398 |
| saiujwal13083 | 279 |
| ujjwalsoni1999 | 277 |
| NaveenKumarNakka | 275 |
| _maverick7_ | 266 |
| blackshadows | 5362 |
| Ibrahim Nash | 5242 |
| akhayrutdinov | 5111 |
| mb1973 | 4931 |
| Quandray | 4598 |