Day - 93

Assalomu alaykum, everyone! I am glad to see you here! It is the 93rd day of my coding challenge!

So, let's start the coding challenge!

1. Problem 1528. Shuffle String

Time Complexity:

The time complexity is O(n), where n is the length of the string?s. This is because the function iterates through the indices array, which has length n, and inserts each character from the string?s?into the buffer?b?at the corresponding index.

Space Complexity:

The space complexity is O(n), where n is the length of the string?s. This is because the function creates a buffer?b?of length n to store the characters from the string?s.

Code:

/*
?* @param {string} s
?* @param {number[]} indices
?* @return {string}
?*/

var restoreString = function (s, indices) {
? const b = [];
? for (let i = 0; i < indices.length; i++) {
? ? b[indices[i]] = s[i];
? }
? return b.join("");
};        

#coding #challenges #leetcode #javascript #typescript #programming #algorithms #problems #solutions