1528. Shuffle String LeetCode Solution

In this guide, you will get 1528. Shuffle String LeetCode Solution with the best time and space complexity. The solution to Shuffle String problem is provided in various programming languages like C++, Java, and Python. This will be helpful for you if you are preparing for placements, hackathons, interviews, or practice purposes. The solutions provided here are very easy to follow and include detailed explanations.

Problem Statement
Complexity Analysis
Shuffle String solution in C++
Shuffle String solution in Java
Shuffle String solution in Python
Additional Resources

1528. Shuffle String LeetCode Solution image

Problem Statement of Shuffle String

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.

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.

Constraints:

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

Complexity Analysis

Time Complexity: O(n)
Space Complexity: O(n)

1528. Shuffle String LeetCode Solution in C++

class Solution {
 public:
  string restoreString(string s, vector<int>& indices) {
    string ans(s.length(), '.');

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

    return ans;
  }
};
/* code provided by PROGIEZ */