leetCode1 min read
1920. Build Array from Permutation | LeetCode Solution | JavaScript | Easy
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.
P
Pranay Kothapalli
October 21, 2024
#leetCode_arrays#leetCode_easy
PK
Pranay Kothapalli
Senior Frontend Developer specializing in UI components and design systems. With over 12 years of experience, I contribute to open-source projects and write about React, TypeScript, and modern web development.
Maintainer at Rad UIFullstack Engineer at Sprinto
Enjoyed this article?
Explore more interactive algorithm visualizations and computer science concepts to continue your learning journey.