You are given a string s and an integer array indices of the same length $n$.

The string s will be rearranged such that the character at index $i$ is placed at position indices[i] in the resulting string.

Return the shuffled string.

Constraints:

• s.length $==$ indices.length $== n$

• $1 \leq n \leq 100$

• s consists of only lowercase English letters.

• $0 \leq$ indices[i] $< n$

• All values of indices are unique.

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.