Introduction

In this blog post, we will explore how to solve the LeetCode problem "1528" using AI. LeetCode is a popular platform for preparing for coding interviews, and with the help of AI tools like Chatmagic, we can generate solutions quickly and efficiently - helping you pass the interviews and get the job offer without having to study for months.

Problem Statement

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.

Explanation

Here's the solution:

• Create a new string/character array of the same length as the input string.
• Iterate through the input string and place each character at the index specified in the indices array in the new string.

• Return the newly created string.

• Runtime Complexity: O(n), Storage Complexity: O(n)

Code

    def restoreString(s: str, indices: list[int]) -> str:
    """
    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.
    """
    n = len(s)
    shuffled_string = [''] * n
    for i in range(n):
        shuffled_string[indices[i]] = s[i]
    return "".join(shuffled_string)