You are given a string text consisting of words separated by spaces.

Rearrange the spaces such that they are distributed equally between every pair of adjacent words, maximizing the number of spaces between them. Any remaining spaces that cannot be evenly distributed must be appended to the end of the string.

Return the resulting string after rearranging the spaces.

Note: If text contains only $1$ word, no spaces can be placed between words, so all spaces must be appended to the end of the string.

Constraints:

• $1 \leq$ text.length $\leq 100$

• text consists of lowercase English letters and ' '.

• text contains at least $1$ word.

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.