Please enter your email address or userHandle.
Given a String of length N reverse each word in it. Words are separated by dots.
The first line contains T denoting the number of testcases. Then follows description of testcases. Each case contains a string containing dots and characters.
For each test case, output a String in single line containing the reversed words of the given String.
1<=Length of String<=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.