|All-time Popular Problems|
|Maximum difference between node and its ancestor|
|Delete a node from BST|
|K’th smallest element|
|Detect cycle in a directed graph|
|Element with left side smaller and right side greater|
|Sort The Array|
|Level order traversal Line by Line|
|Add two numbers represented by linked lists|
|Root to leaf path sum|
Given a String of length N reverse the words 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 spaces and characters.
For each test case, output a single line containing the reversed String.
1<=Lenght of String<=2000