1920. Build Array from Permutation | Zero to FAANG Kunal | Assignment Solution | Leetcode | Shapnesh

Описание: 1920. Build Array from Permutation | Zero to FAANG by Kunal | Assignment Solution | Leetcode | Shapnesh Tiwari

Problem link :
https://leetcode.com/problems/build-a...

Course link:
https://github.com/kunal-kushwaha/DSA...

Complete Java + DSA + Interview Preparation + CP Course
   • Java + DSA + Interview Preparation Course  

Hi, thanks for watching our video about Arrays in Java
In this video we’ll walk you through:
Brute Force
Efficient approach
Solution Code

TIMESTAMPS
Intro
Explanation begins
IDE solution

ABOUT OUR CHANNEL
Our channel is all about Programming. We cover lots of cool stuff such as solution to problems, concept explanation and tricks to master CP
Check out our channel here:
   / @programmerszone  
Don’t forget to subscribe!

CHECK OUT OUR OTHER Playlists

GeeksforGeeks playlist:
   • GeeksforGeeks problems  

Complete C++ Course playlist:
   • Complete C++ playlist  

CodeChef Playlist:
   • CodeChef Problems  

HackerRank playlist:
   • HackeRank problems  

LeetCode problems
   • Leetcode problems Solution  

FIND US AT
https://www.waadanibhao.wordpress.com

GET IN TOUCH
Contact us on [email protected]

Share
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:

Input: nums = [0,2,1,5,3,4]
Output: [0,1,2,4,5,3]
Explanation: The array ans is built as follows:
ans = [nums[nums[0]], nums[nums[1]], nums[nums[2]], nums[nums[3]], nums[nums[4]], nums[nums[5]]]
= [nums[0], nums[2], nums[1], nums[5], nums[3], nums[4]]
= [0,1,2,4,5,3]
Example 2:

Input: nums = [5,0,1,2,3,4]
Output: [4,5,0,1,2,3]
Explanation: The array ans is built as follows:
ans = [nums[nums[0]], nums[nums[1]], nums[nums[2]], nums[nums[3]], nums[nums[4]], nums[nums[5]]]
= [nums[5], nums[0], nums[1], nums[2], nums[3], nums[4]]
= [4,5,0,1,2,3]


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)?

Accepted
37.5K
Submissions
40.2K
Seen this question in a real interview before?

Yes

No
Just apply what's said in the statement.
Notice that you can't apply it on the same array directly since some elements will change after application

#codechef #coding #python #hackerrank #programming #java #computerscience #coder #code #competitiveprogramming #machinelearning #pythonprogramming #algorithms #cpp #javascript #hackerearth #webdeveloper #geeksforgeeks #codinglife #leetcode #c #codeforces #engineering #codingmemes #programmer #hacker #programmingmemes #topcoder #webdevelopment #bhfyp #DSAwithKunal