You are given a $0$ indexed string s and a $0$ indexed integer array spaces that contains the indices in the original string where spaces should be added.

Each space should be inserted immediately before the character located at the corresponding index in s.

Return the modified string after inserting all the spaces.

Constraints:

• $1 \leq$ s.length $\leq 3 \times 10^5$

• s consists only of lowercase and uppercase English letters.

• $1 \leq$ spaces.length $\leq 3 \times 10^5$

• $0 \leq$ spaces[i] $\leq$ s.length $- 1$

• All the values of spaces are strictly increasing.

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.