<pre class="language-javascript"><code class="language-javascript">/**
 * @param {any[]} items
 * @param {number[]} newOrder
 * @return {void}
 */
function sort(items, newOrder) {
 for(let i = 0; i &lt; items.length; i++) {
 const j = newOrder[i];
 swap(items, i, j);
 swap(newOrder, i, j);
 }

 return items;
}

function swap(arr, i, j) {
 [arr[i], arr[j]] = [arr[j], arr[i]];
}
</code></pre>

O(n) time and O(1) space solution

Suppose we have an array of items - A, and another array of indexes in numbers - B const A = ['A', 'B', 'C', 'D', 'E', 'F'] const B = [1, 5, 4, 3, 2, …