Reverse String Word-Wise Problem Statement

Reverse the given string so that the last word appears first, the second last word appears second, and so on, while keeping the individual words unchanged.

Explanation:

The intention is to reorder the words in the string, without altering the words themselves.

Input:

String in a single line

Output:

Word wise reversed string in a single line

Example:

Input:

Hello world here

Output:

here world Hello

Constraints:

0

Question

Reverse String Word-Wise Problem Statement

Reverse the given string so that the last word appears first, the second last word appears second, and so on, while keeping the individual words unchanged.

Explanation:

The intention is to reorder the words in the string, without altering the words themselves.

Input:

String in a single line

Output:

Word wise reversed string in a single line

Example:

Input:

Hello world here

Output:

here world Hello

Constraints:

0 <= |S| <= 10^7 where |S| represents the length of string, S.

Note:

The solution must handle the size of the input string efficiently given the constraints.

Accepted Answer

Reverse the given string word-wise while keeping the individual words unchanged.

Split the input string by space to get individual words
Reverse the array of words
Join the reversed array of words back into a single string