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.
User Task:
The task is to complete the function reverseWords() which reverse words from the given string and prints the answer. The newline is automatically appended by the driver code.
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
Explanation:
Testcase 1: After reversing the whole string(not individual words), the input string becomes much.very.program.this.like.i.
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.
| geetyadav | 82 |
| hari32147 | 76 |
| AdityaRaj9 | 75 |
| yashrana1 | 74 |
| amitpandey19 | 67 |
| abducodes | 850 |
| harshtyagi36 | 417 |
| vamsikrishna55 | 323 |
| sandipbhaumik | 321 |
| Akhil varma | 314 |
| blackshadows | 5331 |
| Ibrahim Nash | 5219 |
| akhayrutdinov | 5111 |
| mb1973 | 4929 |
| Quandray | 4567 |