Given a string s, reverse the characters of each word in s while preserving the order of the words and the spaces between them.

Return the resulting string.

Note: A word is a maximal substring of non space characters.

Constraints:

• $1 \leq$ s.length $\leq 5 imes 10^4$

• s contains printable ASCII characters.

• s has no leading or trailing spaces.

• s contains at least one word.

• Every word in s is separated by exactly one space.

Now, let’s take a moment to make sure you’ve correctly understood the problem. The quiz below helps you check if you’re solving the correct problem:

We have a game for you to play. Rearrange the logical building blocks to develop a clearer understanding of how to solve this problem.

Implement your solution in the following coding playground.