You are given a string s and an integer array indices of the same length. The string s will be shuffled such that the character at the ith position moves to indices[i] in the shuffled string.

Return the shuffled string.

&nbsp;
Example 1:

Input: s = "codeleet", indices = [4,5,6,7,0,2,1,3]
Output: "leetcode"
Explanation: As shown, "codeleet" becomes "leetcode" after shuffling.


Example 2:

Input: s = "abc", indices = [0,1,2]
Output: "abc"
Explanation: After shuffling, each character remains in its position.


&nbsp;
Constraints:


	s.length == indices.length == n
	1 &lt;= n &lt;= 100
	s consists of only lowercase English letters.
	0 &lt;= indices[i] &lt; n
	All values of indices are unique.


class Solution:
    def restoreString(self, s: str, indices: List[int]) -> str:
        dec = {}
        c = 0
        res=''
        for i in indices:
            dec[i] = s[c]
            c += 1
        # dec = {"4":"c","5":"o","6":"d","7":"e","0":"l","2":"e","1":"e","3":"t"}
        for x in range(len(indices)):
            res += dec[x]
            # x in range 0, 1, 2,....... len *indices or s*
        return res
class Solution {
    public String restoreString(String s, int[] indices) {
        char[] ch = new char[s.length()];
        for(int i = 0 ; i< s.length() ; i ++){
            ch[indices[i]]=s.charAt(i);
        }
        return new String (ch);
    }
}
class Solution {
public:
    string restoreString(string s, vector<int>& indices) {

        string ans = s;

        for(int i=0 ; i<s.size() ; i++){
            ans[indices[i]] = s[i];
        }

        return ans;
    }
};
var restoreString = function(s, indices) {
    const result = []
    
    for(let i=0; i<s.length; i++) {
        const letter = s[i]
        const index = indices[i]
        result[index] = letter
    }
    
    return result.join('')
};
Shuffle String