# Build Array from Permutation — Day 103(Python)

Today, we will look into another easy problem.

1920. Build Array from Permutation

Given a zero-based permutation `nums` (0-indexed), build an array `ans` of the same length where `ans[i] = nums[nums[i]]` for each `0 <= i < nums.length` and return it.

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

Example 1:

Example 2:

Constraints:

• `1 <= nums.length <= 1000`
• `0 <= nums[i] < nums.length`
• The elements in `nums` are distinct.

Follow-up: Can you solve it without using an extra space (i.e., `O(1)` memory)?

We are given a zero-based permutation, which means in our array we have numbers from 0 to length(nums)-1. We need to return an array whose elements are positioned as nums[nums[i]].

Complexity

Time Complexity

Since we are just traversing through the array once, the time complexity is O(N).

Space Complexity

We are using extra space to store our result, hence space complexity is O(N).

Let us try to solve the follow-up question.

Here we are running for-loop inside the return statement itself.

Time Complexity

Since we are just traversing through the array once, the time complexity is O(N).

Space Complexity

We are not using any extra space, and hence the space complexity will be O(1).

--

--

## More from Annamariya Tharayil

Software Engineer. Find me @ www.linkedin.com/in/annamariya-jt