added array shift

Author: vinodh99

findThreeLargestNumbers.js

@@ -0,0 +1,31 @@
+function findThreeLargestNumbers(array) {
+  // space complexity=o(1), TC=o(n)
+  const largest = [null, null, null];
+  for (let value of array) {
+    update(largest, value);
+  }
+  return largest;
+}
+
+function update(largest, value) {
+  if (largest[2] === null || value > largest[2]) {
+    shift(largest, value, 2);
+  } else if (largest[1] === null || value > largest[1]) {
+    shift(largest, value, 1);
+  } else if (largest[0] === null || value > largest[0]) {
+    shift(largest, value, 0);
+  }
+}
+
+function shift(array, value, idx) {
+  for (let i = 0; i <= idx; i++) {
+    if (i === idx) {
+      array[i] = value;
+    } else {
+      array[i] = array[i + 1];
+    }
+  }
+}
+
+// Do not edit the line below.
+exports.findThreeLargestNumbers = findThreeLargestNumbers;

powerset.js

@@ -14,6 +14,7 @@ console.log(powerset([1, 2, 3]));
 
 // recursive solution
 
+// time and space complexity o(n2^n)
 function powerset(array, index = null) {
   if (index === null) {
     index = array.length - 1;

pyramid.js

@@ -1,8 +1,4 @@
 
-
-
-
-
 pyramid=(k)=>{
 	arr2=[];
 	result=[];

smallestDifference.js

@@ -0,0 +1,17 @@
+function smallestDifference(arrayOne, arrayTwo) {
+  // Write your code here.
+  let value = arrayOne[i] - arrayTwo[j];
+  for (let i = 0; i < arrayOne.length; i++) {
+    for (let j = 0; j < arrayTwo.length; j++) {
+      if (Math.abs(arrayOne[i] - arrayTwo[j]) < value) {
+        value = Math.abs(arrayOne[i] - arrayTwo[j]);
+        let arr = [];
+        arr.push(arrayOne[i]);
+        arr.push(arrayTwo[j]);
+      }
+    }
+  }
+}
+
+// Do not edit the line below.
+exports.smallestDifference = smallestDifference;