Please enter your email address or userHandle.
Given a String of length S, reverse the whole string without reversing the individual words in it. Words are separated by dots.
The first line contains T denoting the number of testcases. T testcases follow. Each case contains a string S containing characters.
For each test case, in a new line, output a single line containing the reversed String.
1 <= T <= 100
1 <= |S| <= 2000
We strongly recommend solving this problem on your own before viewing its editorial. Do you still want to view the editorial?
Login to access your submissions.
Please choose 'ReadOnlyMode' if you needn't to 'Edit' the problem e.g. viewing OJ's solution, TestCase Files (TCFs), TimeLimit etc.