Given a zero-based permutation nums, construct an array ans of the same length such that, ans[i] = nums[nums[i]] for every valid index i.

Return the constructed array ans.

A zero-based permutation is an array of distinct integers from 0 to nums.length - 1, inclusive.

Constraints:

• $1 \leq$ nums.length $\leq 10^3$

• $0 \leq$ nums[i] $<$ nums.length

• All elements in nums are distinct.

Now, let’s take a moment to make sure you’ve correctly understood the problem. The quiz below helps you check if you’re solving the correct problem:

We have a game for you to play. Rearrange the logical building blocks to develop a clearer understanding of how to solve this problem.

Implement your solution in the following coding playground.