Add solution #1920

Author: JoshCrozier

README.md

@@ -212,6 +212,7 @@
 1672|[Richest Customer Wealth](./1672-richest-customer-wealth.js)|Easy|
 1780|[Check if Number is a Sum of Powers of Three](./1780-check-if-number-is-a-sum-of-powers-of-three.js)|Medium|
 1880|[Check if Word Equals Summation of Two Words](./1880-check-if-word-equals-summation-of-two-words.js)|Easy|
+1920|[Build Array from Permutation](./1920-build-array-from-permutation.js)|Easy|
 1929|[Concatenation of Array](./1929-concatenation-of-array.js)|Easy|
 1935|[Maximum Number of Words You Can Type](./1935-maximum-number-of-words-you-can-type.js)|Easy|
 1996|[The Number of Weak Characters in the Game](./1996-the-number-of-weak-characters-in-the-game.js)|Medium|

solutions/1920-build-array-from-permutation.js

@@ -0,0 +1,19 @@
+/**
+ * 1920. Build Array from Permutation
+ * https://leetcode.com/problems/build-array-from-permutation/
+ * Difficulty: 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.
+ *
+ * A zero-based permutation nums is an array of distinct integers from 0 to nums.length - 1
+ * (inclusive).
+ */
+
+/**
+ * @param {number[]} nums
+ * @return {number[]}
+ */
+var buildArray = function(nums) {
+  return nums.map(n => nums[n]);
+};