1122. Relative Sort Array

Author: Tushar Borole

.idea/workspace.xml

@@ -9,6 +9,7 @@
 |:-----|:--------------------------------------------------------------------------------------------------------------------------------------------|:--------------------------------------------------------------------------------------------------------------|:-----------------|:---------------------|:-----------|:----------------|:-----------------|:------------------------------------------------------------------|
 | 709  | [To Lower Case](https://leetcode.com/problems/to-lower-case/)                                                                               | [Solution](to_lower_case.js)                                                                                  | 72 ms            | 32.1 MB              | Easy       |                 |                  |                                                                   |
 | 122  | [Best Time to Buy and Sell Stock II](https://leetcode.com/problems/best-time-to-buy-and-sell-stock-ii/)                                     | [iterative](best_time_to_buy_and_sell_stock_II.js)                                                            | 56 ms            | 35.4 MB              | Easy       | O(N)            | O(1)             |                                                                   |
+| 1122 | [Relative Sort Array](https://leetcode.com/problems/relative-sort-array/)                                                                   | [Ittrative](relative_sort_array.js)                                                              | 52 ms            | 34.9 MB              | Easy       |                 |                  |                                                                   |
 | 344  | [Reverse String](https://leetcode.com/problems/reverse-string/)                                                                             | [Recursive](reverse_string.js)                                                                                | 112 ms           | 48.6 MB              | Easy       | 0(N)            | 0(1)             |                                                                   |
 | 509  | [Fibonacci Number](https://leetcode.com/problems/fibonacci-number/)                                                                         | [Solution](fibonacci_number.js)                                                                               | 76 ms            | 34.3 MB              | Easy       |                 |                  |                                                                   |
 | 70   | [Climbing Stairs](https://leetcode.com/problems/climbing-stairs/)                                                                           | [Recursive](climbing_stairs.js)                                                                               | 52 ms            | 33.9 MB              | Easy       | 0(N)            | O(N)             | [:link:](https://www.youtube.com/watch?v=NFJ3m9a1oJQ)             |

README.md

@@ -0,0 +1,61 @@
+// 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 don't appear in arr2 should be placed at the end of arr1 in ascending order.
+//
+//
+//
+// Example 1:
+//
+// Input: arr1 = [2,3,1,3,2,4,6,7,9,2,19], arr2 = [2,1,4,3,9,6]
+// Output: [2,2,2,1,4,3,3,9,6,7,19]
+//
+//
+// Constraints:
+//
+//     arr1.length, arr2.length <= 1000
+// 0 <= arr1[i], arr2[i] <= 1000
+// Each arr2[i] is distinct.
+//     Each arr2[i] is in arr1.
+
+let arrayToSet = function(arr) {
+  let arrayMap = new Map();
+  for (let val of arr) {
+    if (!arrayMap.has(val)) {
+      arrayMap.set(val, 0);
+    }
+    arrayMap.set(val, arrayMap.get(val) + 1);
+  }
+
+  return arrayMap;
+};
+
+/**
+ * @param {number[]} arr1
+ * @param {number[]} arr2
+ * @return {number[]}
+ */
+var relativeSortArray = function(arr1, arr2) {
+  let out = [];
+  let remainingArray = [];
+
+  let arrayMap = arrayToSet(arr1);
+
+  for (let val of arr2) {
+    out.push(...Array.from({ length: arrayMap.get(val) }, i => val));
+    arrayMap.delete(val);
+  }
+
+  arrayMap.forEach(function(value, key) {
+    remainingArray.push(...Array.from({ length: arrayMap.get(key) }, i => key));
+  });
+
+  remainingArray.sort((a, b) => a - b); //?
+
+  out = [...out, ...remainingArray];
+  return out;
+};
+
+relativeSortArray(
+  [2, 21, 43, 38, 0, 42, 33, 7, 24, 13, 12, 27, 12, 24, 5, 23, 29, 48, 30, 31],
+  [2, 42, 38, 0, 43, 21]
+); //?