A sentence is a sequence of words separated by single spaces. Each word has a $1$ indexed value from $1$ to $9$ appended to its end, representing its original position in the sentence.

Given a shuffled sentence s, reconstruct and return the original sentence by ordering the words according to their appended positions and removing the numbers.

Constraints:

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

• s consists of lowercase and uppercase English letters, spaces, and digits from $1$ to $9$.

• The number of words in s is between $1$ and $9$.

• The words in s are separated by a single space.

• s contains no leading or trailing spaces.

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.