[ADD] sorted union added

luisprooc · luisprooc · commit 08847eb31a25 · 2021-07-06T11:37:40.000-04:00
diff --git a/README.md b/README.md
@@ -482,3 +482,21 @@ pairElement("TTGAG") should return [["T","A"],["T","A"],["G","C"],["A","T"],["G"
 pairElement("CTCTA") should return [["C","G"],["T","A"],["C","G"],["T","A"],["A","T"]].
 
 ```
+
+
+## Sorted Union
+
+Write a function that takes two or more arrays and returns a new array of unique values in the order of the original provided arrays.
+
+In other words, all values present from all arrays should be included in their original order, but with no duplicates in the final array.
+
+The unique numbers should be sorted by their original order, but the final array should not be sorted in numerical order.
+
+```javascript
+uniteUnique([1, 3, 2], [5, 2, 1, 4], [2, 1]) should return [1, 3, 2, 5, 4].
+
+uniteUnique([1, 2, 3], [5, 2, 1]) should return [1, 2, 3, 5].
+
+uniteUnique([1, 2, 3], [5, 2, 1, 4], [2, 1], [6, 7, 8]) should return [1, 2, 3, 5, 4, 6, 7, 8].
+
+```
diff --git a/src/sortedUnion.js b/src/sortedUnion.js
@@ -0,0 +1,15 @@
+function uniteUnique(...args) {
+    const uniteArray = args[0];
+    args = args.splice(1);
+    for(let i = 0; i < args.length; ++i){
+        for(let j = 0; j < args[i].length; ++j){
+            if(!uniteArray.includes(args[i][j])){
+                uniteArray.push(args[i][j]);
+            }
+        }    
+    }
+
+    return uniteArray;
+}
+  
+console.log(uniteUnique([1, 3, 2], [5, 2, 1, 4], [2, 1]));
