Add solution #1122

Author: JoshCrozier

README.md

@@ -278,6 +278,7 @@
 1081|[Smallest Subsequence of Distinct Characters](./1081-smallest-subsequence-of-distinct-characters.js)|Medium|
 1103|[Distribute Candies to People](./1103-distribute-candies-to-people.js)|Easy|
 1108|[Defanging an IP Address](./1108-defanging-an-ip-address.js)|Easy|
+1122|[Relative Sort Array](./1122-relative-sort-array.js)|Easy|
 1189|[Maximum Number of Balloons](./1189-maximum-number-of-balloons.js)|Easy|
 1207|[Unique Number of Occurrences](./1207-unique-number-of-occurrences.js)|Easy|
 1232|[Check If It Is a Straight Line](./1232-check-if-it-is-a-straight-line.js)|Easy|

solutions/1122-relative-sort-array.js

@@ -0,0 +1,22 @@
+/**
+ * 1122. Relative Sort Array
+ * https://leetcode.com/problems/relative-sort-array/
+ * Difficulty: Easy
+ *
+ * Given two arrays arr1 and arr2, the elements of arr2 are distinct, and all
+ * elements in arr2 are also in arr1.
+ *
+ * Sort the elements of arr1 such that the relative ordering of items in arr1
+ * are the same as in arr2. Elements that do not appear in arr2 should be
+ * placed at the end of arr1 in ascending order.
+ */
+
+/**
+ * @param {number[]} arr1
+ * @param {number[]} arr2
+ * @return {number[]}
+ */
+var relativeSortArray = function(arr1, arr2) {
+  const map = new Map(arr2.map((v, i) => [v, i]));
+  return arr1.sort((a, b) => (map.get(a) ?? arr2.length + a) - (map.get(b) ?? arr2.length + b));
+};