final commit

Author: varun93

tuts/warmup-questions/README.md

@@ -0,0 +1 @@
+## Very easy questions one should be familiar with or practice before proceeding on to the harder ones

tuts/warmup-questions/additional-questions.txt

@@ -0,0 +1,8 @@
+1.Given a graph, had to compute a list of how many cities 
+where at a hop distance away from a specific node
+
+2. Given a collection (matrix) of pixels you must find the size of the largest shape. 
+
+3. Given a string representing taken seats on a plane and a number N representing the rows on a plane, return the amount of seating arrangements for a family of 3. Seating between isles is not a possible arrangement. 
+The seating columns are as follows: ABC | DEFG | HJK.
+

tuts/warmup-questions/first-non-repeating-char.js

@@ -0,0 +1,26 @@
+const firstNonRepeatingCharacterConstantSpace = string => {
+  for (let index = 0; index < string.length; index++) {
+    if (string.lastIndexOf(string[index]) === index) {
+      return string[index];
+    }
+  }
+};
+
+const firstNonRepeatingCharacterLinearTime = string => {
+  const freqCount = string.split("").reduce((freqCount, character) => {
+    const count = freqCount[character] || 0;
+    freqCount[character] = count + 1;
+    return freqCount;
+  }, {});
+
+  for (let index = 0; index < string.length; index++) {
+    if (freqCount[string[index]] === 1) {
+      return string[index];
+    }
+  }
+};
+console.log(
+  firstNonRepeatingCharacterLinearTime(
+    "the quick brown fox jumps then quickly blow air"
+  )
+);

tuts/warmup-questions/largest-pair-sum.js

@@ -0,0 +1,25 @@
+const largestPairSum = array => {
+  if (array.length < 2) {
+    return -1;
+  }
+  let [largest, secondLargest] = [
+    Math.max(array[0], array[1]),
+    Math.min(array[0], array[1])
+  ];
+  for (let i = 2; i < array.length; i++) {
+    const element = array[i];
+    if (element > element) {
+      const temp = largest;
+      largest = element;
+      secondLargest = temp;
+    } else if (element > secondLargest) {
+      secondLargest = element;
+    }
+  }
+
+  return largest + secondLargest;
+};
+
+const array = [4, 9, 14, 2, 7, 6];
+
+console.log(largestPairSum(array));

tuts/warmup-questions/merge-sorted.js

@@ -0,0 +1,24 @@
+const mergeSortedArrays = (A, B) => {
+  let i = 0,
+    j = 0;
+  const result = [];
+  while (A[i] || B[j]) {
+    if (A[i] !== undefined) {
+      result.push(B[j++]);
+    }
+    if (B[j] !== undefined) {
+      result.push(A[i++]);
+    }
+    if (A[i] < B[j]) {
+      result.push(A[i++]);
+    }
+    if (B[j] < A[i]) {
+      result.push(B[j++]);
+    } else {
+      result.push(A[i++]);
+      result.push(B[j++]);
+    }
+  }
+  return result;
+};
+console.log(mergeSortedArrays([2, 5, 6, 9], [1, 2, 3, 29]));

tuts/warmup-questions/remove-duplicates.js

@@ -1 +1,28 @@
-const removeDuplicatesUno
+const removeDuplicatesUnorted = array => {
+  //
+  const map = array.reduce((map, element) => {
+    if (!map[element]) {
+      map[element] = true;
+    }
+    return map;
+  }, {});
+
+  return Object.keys(map).map(element => parseInt(element));
+};
+
+const removeDuplicatesSorted = array => {
+  let lagger = 1;
+  for (let i = 1; i < array.length - 1; i++) {
+    while (array[i] === array[i - 1]) {
+      i++;
+    }
+    array[lagger++] = array[i];
+  }
+  array.length = lagger;
+};
+
+// const array = [1, 2, 1, 1, 4, 6];
+// console.log(removeDuplicatesUnorted(array));
+const array = [1, 1, 1, 3, 3, 4, 4, 5, 6, 6];
+removeDuplicatesSorted(array);
+console.log(array);

tuts/warmup-questions/removeDuplicateChar.js

@@ -0,0 +1,8 @@
+const removeDuplicateChar = string => {
+  const map = string.split("").reduce((map, character) => {
+    map[character] = true;
+    return map;
+  }, {});
+
+  return Object.keys(map).join("");
+};

tuts/warmup-questions/reverse-words-in-a-sentence.js

@@ -0,0 +1,13 @@
+const reverseWordsInPlace = sentence => {
+  return sentence
+    .split(" ")
+    .map(word =>
+      word
+        .split("")
+        .reverse()
+        .join("")
+    )
+    .join(" ");
+};
+
+console.log(reverseWordsInPlace("What are you doing"));

tuts/warmup-questions/reverse-words.js

@@ -0,0 +1,3 @@
+const reverse = sentence => {
+  return sentence.split(" ").reverse();
+};

tuts/warmup-questions/swap-without-temp.js

@@ -0,0 +1,6 @@
+const swap = (a, b) => {
+  a = a ^ b;
+  b = a ^ b;
+  a = a ^ b;
+  return [b, a];
+};