Reverse Words In A String Problem Statement

Given a string of length N, reverse the string word by word. Ensure that the output reversed string has a single space between two words and does not contain leading or trailing spaces.

Example:

Input:

"  Welcome to   Coding  Ninjas"

Output:

"Ninjas Coding to Welcome"

Explanation:

The reversed string contains only a single space between words and eliminates any leading or trailing spaces.

Input:

The first line of input contains an integer T, representing the number of test cases. Each of the following T lines contains a string to be reversed word by word.

Output:

For each test case, return the reversed string with a single space between words and no trailing spaces.

Constraints:

• 1 <= T <= 50
• 0 <= N <= 10^5

Time Limit: 1 second