Intermediate algo scripting

Author: Yasholo

Intermediate-Algorithm-Scripting/01.Sum-All-Numbers-in-a-Range.js

@@ -0,0 +1,20 @@
+function sumAll(arr) {
+  let sum = 0;
+  if (arr[0]>arr[1]) {
+    let i = arr[1];
+    let j = arr[0];
+    for (i; i<=j; i++){
+      sum+=i;
+    }
+  }
+  else {
+    let i = arr[0];
+    let j = arr[1];
+    for (i; i<=j; i++){
+      sum+=i;
+    }
+  }
+  return sum;
+}
+
+console.log(sumAll([1, 4]));

Intermediate-Algorithm-Scripting/02.Diff-Two-Arrays.js

@@ -0,0 +1,7 @@
+function diffArray(arr1, arr2) {
+  return [...diff(arr1, arr2), ...diff(arr2, arr1)];
+
+  function diff(a, b) {
+    return a.filter(item => b.indexOf(item) === -1);
+  }
+}

Intermediate-Algorithm-Scripting/03.Seek-and-Destroy.js

@@ -0,0 +1,8 @@
+function destroyer(arr) {
+  const valsToRemove = Array.from(arguments).slice(1);
+  return arr.filter(function(val) {
+    return !valsToRemove.includes(val);
+  });
+}
+
+console.log(destroyer([1, 2, 3, 1, 2, 3], 2, 3));

Intermediate-Algorithm-Scripting/04.Where-art-thou.js

@@ -0,0 +1,11 @@
+function whatIsInAName(collection, source) {
+  const sourceKeys = Object.keys(source);
+
+  return collection
+    .filter(obj => sourceKeys
+      .every(key => obj.hasOwnProperty(key) &&
+        obj[key] === source[key]))
+
+}
+
+console.log(whatIsInAName([{ first: "Romeo", last: "Montague" }, { first: "Mercutio", last: null }, { first: "Tybalt", last: "Capulet" }], { last: "Capulet" }));

Intermediate-Algorithm-Scripting/05.Spinal-Tap-Case.js

@@ -0,0 +1,8 @@
+function spinalCase(str) {
+  return str
+    .split(/\s|_|(?=[A-Z])/)
+    .join("-")
+    .toLowerCase();
+}
+
+console.log(spinalCase('This Is Spinal Tap'));

Intermediate-Algorithm-Scripting/06.Pig-Latin.js

@@ -0,0 +1,7 @@
+function translatePigLatin(str) {
+  return str
+    .replace(/^[aeiou]\w*/, "$&way")
+    .replace(/(^[^aeiou]+)(\w*)/, "$2$1ay");
+}
+
+translatePigLatin("consonant");

Intermediate-Algorithm-Scripting/07.Search-and-Replace.js

@@ -0,0 +1,10 @@
+function myReplace(str, before, after) {
+      const strArr = str.split(" ");
+  const [wordToReplace] = strArr.filter(item => item === before);
+  const replacement = wordToReplace[0] === wordToReplace[0].toUpperCase()
+    ? after[0].toUpperCase() + after.slice(1)
+    : after[0].toLowerCase() + after.slice(1);
+  return strArr.map(item => (item === before ? replacement : item)).join(" ");
+}
+
+console.log(myReplace("A quick brown fox jumped over the lazy dog", "jumped", "leaped"));

Intermediate-Algorithm-Scripting/08.DNA-Pairing.js

@@ -0,0 +1,12 @@
+function pairElement(str) {
+  const pair = {
+    A: "T",
+    T: "A",
+    C: "G",
+    G: "C"
+  };
+  
+  return str.split("").map(x=>[x, pair[x]]);
+}
+
+console.log(pairElement("GCG"));

Intermediate-Algorithm-Scripting/09.Missing-letters.js

@@ -0,0 +1,11 @@
+function fearNotLetter(str) {
+  var missing;
+  for(var i = 1; i<str.length; i++){
+    if(str.charCodeAt(i) !== str.charCodeAt(i-1)+1){
+      missing = String.fromCharCode(str.charCodeAt(i - 1) + 1);
+    }
+  }
+  return missing;
+}
+
+console.log(fearNotLetter("abce"));

Intermediate-Algorithm-Scripting/10.Sorted-Union.js

@@ -0,0 +1,15 @@
+function uniteUnique(arr) {
+  var arr1 = [];
+  for(var i of arguments) {
+    for(var k of i) {
+      if(arr1.indexOf(k) === -1) {
+        arr1.push(k);
+      }
+    }
+  }
+  arr = arr1;
+  return arr;
+//return [...new Set(Array.from(arguments).reduce((a, b) => a.concat(b)))];
+}
+
+console.log(uniteUnique([1, 3, 2], [5, 2, 1, 4], [2, 1]));