We use cookies (including Google cookies) to personalize ads and analyze traffic. By continuing to use our site, you accept our Privacy Policy.

SimplyLeet
TagsDisclaimersPrivacyTermsContactAbout Us

Shuffle String

Difficulty: Easy

Problem Description

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.

Key Insights

  • Each character in the string s is moved to a new position defined by the indices array.
  • The length of s and indices is guaranteed to be the same.
  • All values in indices are unique and within the bounds of the string length.

Space and Time Complexity

Time Complexity: O(n) - where n is the length of the string. Space Complexity: O(n) - for the output string.

Solution

To solve this problem, we will use an array (or list) to build the resulting shuffled string. We will iterate over the indices array, and for each index i, we will place the character from the original string s at the position specified by indices[i]. Finally, we will join the array into a string and return it.

Code Solutions

def shuffle_string(s, indices):
    # Create a list of the same length as s to hold the shuffled characters
    shuffled = [''] * len(s)
    
    # Iterate over each character and its corresponding index
    for i in range(len(s)):
        shuffled[indices[i]] = s[i]
    
    # Join the list into a string and return
    return ''.join(shuffled)
← Back to All Questions