Given a string s, return a list of strings representing all the words printed vertically in the order they appear in s.

Words are separated by single spaces. Shorter words must be padded with spaces if a character at that position is missing, but trailing spaces are not allowed at the end of any output string.

Note: Each output string represents the characters at the $i$-th index across all words in s, with trailing spaces stripped.

Constraints:

• $1 \leq$ s.length $\leq 200$

• s contains only uppercase English letters and spaces.

• It is guaranteed that there is only $1$ space between $2$ words.

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.