Gold

easy/count-instances-of-a-character-in-a-string/code.js

@@ -1,5 +1,11 @@
 function charCount(myChar, str) {
-  // Your code here.
+  let counted = 0;
+  for (let i = 0; i < str.length; i++) {
+    if (str[i] === myChar) {
+      counted++;
+    }
+  }
+  return counted;
 }
 
 module.exports = charCount;

easy/count-ones-in-a-2d-array/code.js

@@ -1,5 +1,13 @@
 function countOnes(matrix) {
-  // Your code here.
+  let counted = 0;
+  for (let i = 0; i < matrix.length; i++) {
+    for (let k = 0; k < matrix[i].length; k++) {
+      if (matrix[i][k] === 1) {
+        counted++
+      }
+    }
+  }
+  return counted;
 }
 
 module.exports = countOnes;

easy/even-or-odd-number-of-factors/code.js

@@ -1,5 +1,9 @@
 function factorGroup(num) {
-  // Your code here.
+  if (num % 2 === 0) {
+    return "odd";
+  } else {
+    return "even";
+  }
 }
 
 module.exports = factorGroup;

easy/factor-chain/code.js

@@ -1,5 +1,10 @@
 function factorChain(arr) {
-  // Your code here.
+  for (let i = 0; i < arr.length - 1; i++) {
+    if (arr[i + 1] % arr[i] !== 0) {
+      return false;
+    }
+  }
+  return true;
 }
 
 module.exports = factorChain;

easy/filter-out-strings-from-an-array/code.js

@@ -1,5 +1,11 @@
 function filterArray(arr) {
-  // Your code here.
+  const newArr = [];
+  for (let i = 0; i < arr.length; i++) {
+    if (typeof(arr[i]) === "number") {
+      newArr.push(arr[i])
+    }
+  }
+  return newArr;
 }
 
 module.exports = filterArray;

easy/find-the-largest-numbers-in-a-group-of-arrays/code.js

@@ -1,5 +1,15 @@
 function findLargestNums(arr) {
-  // Your code here.
+  const newArr = [];
+  for (let i  = 0; i < arr.length; i++) {
+    let biggest = arr[i][0]
+    for (let k = 0; k < arr[i].length; k++) {
+      if (arr[i][k] > biggest) {
+        biggest = arr[i][k]
+      }
+    }
+    newArr.push(biggest);
+  }
+  return newArr;
 }
 
 module.exports = findLargestNums;

easy/find-the-minimum-maximum-length-and-average-values/code.js

@@ -1,5 +1,23 @@
 function minMaxLengthAverage(arr) {
-  // Your code here.
+  const newArr = [];
+  let min = arr[0];
+  let max = arr[0];
+  let total = 0;
+  for (let i = 0; i < arr.length; i++) {
+    if (min > arr[i]) {
+      min = arr[i]
+    }
+    if (max < arr[i]) {
+      max = arr[i]
+    }
+    total += arr[i]
+  }
+  newArr.push(min);
+  newArr.push(max);
+  newArr.push(arr.length);
+  newArr.push(total / arr.length);
+
+  return newArr;
 }
 
 module.exports = minMaxLengthAverage;

easy/find-the-smallest-and-biggest-numbers/code.js

@@ -1,5 +1,19 @@
 function minMax(arr) {
-  // Your code here.
+  const newArr = [];
+  let min = arr[0];
+  let max = arr[0];
+  for (let i = 0; i < arr.length; i++) {
+    if (arr[i] > max) {
+      max = arr[i];
+    }
+    if (arr[i] < min) {
+      min = arr[i]
+    }
+  }
+  newArr.push(min);
+  newArr.push(max);
+
+  return newArr;
 }
 
 module.exports = minMax;

hard/find-repeating/code.js

@@ -1,5 +1,15 @@
 function findRepeating(str) {
-  // Your code here.
+  const arr = [];
+  let stack = 0;
+  const tempArr = [];
+  for (let i = 0; i < str.length; i++)  {
+    let current = str[i];
+    if (stack === 0) {
+      tempArr.push(str[i]);
+    }
+  }
+
+  return arr;
 }
 
 module.exports = findRepeating;

hard/find-the-shared-letters-between-two-strings/code.js

@@ -1,5 +1,16 @@
 function sharedLetters(str1, str2) {
-  // Your code here.
+  const copies  =  [];
+  str1 = str1.toLowerCase();
+  str2 = str2.toLowerCase();
+  for (let i = 0; i < str1.length; i++) {
+    if (str2.includes(str1[i]) && !copies.includes(str1[i]))  {
+      copies.push(str1[i]);
+    }
+  }
+
+  copies.sort();
+
+  return copies.join("");
 }
 
 module.exports = sharedLetters;

hard/find-the-shortest-word-s-in-a-sentence/code.js

@@ -1,5 +1,21 @@
 function findShortestWords(str) {
-  // Your code here.
+  const words = str.split(" ");
+  const wordLength = [];
+  const shortest = [];
+  let min = words[0].length;
+  for (let i = 0; i < words.length; i++) {
+    wordLength.push(words[i].length);
+    if (min > words[i].length) min = words[i].length;
+  }
+
+  for (let i = 0; i < words.length; i++)  {
+    if (words[i].length === min && isNaN(parseInt(words[i]))) {
+      shortest.push(words[i].toLowerCase());
+    }
+  }
+
+  console.log(words, wordLength, min);
+  return shortest.sort();
 }
 
 module.exports = findShortestWords;

hard/flip-the-array/code.js

@@ -1,5 +1,21 @@
 function flipArray(arr) {
-  // Your code here.
+  if (!arr[0]) {
+    return [];
+  }
+  const newArr = [];
+  let columns = arr[0].length;
+
+  if (columns === undefined) {
+    for (let i = 0; i < arr.length; i++) {
+      newArr.push([arr[i]]);
+    }
+  } else {
+    for (let i = 0; i < arr.length; i++) {
+      newArr.push(arr[i][0]);
+    }
+  }
+
+  return newArr;
 }
 
 module.exports = flipArray;

hard/fridge-poetry/code.js

@@ -1,5 +1,14 @@
 function canBuild(s1, s2) {
-  // Your code here.
+  const string1 = s1.replace(/ /g, '');
+  const string2 = s2.replace(/ /g, '');
+
+  for (let i = 0; i < s1.length; i++) {
+    if (!s1.includes(s2[i]))  {
+      return false;
+    }
+  }
+
+  return true;
 }
 
 module.exports = canBuild;

hard/game-of-thrones-character-titles/code.js

@@ -1,5 +1,15 @@
 function correctTitle(str) {
-  // Your code here.
+ const words = str.split(" ")
+ for (let i = 0; i < words.length; i++) {
+  const currentWord = words[i].toLowerCase();
+  if (currentWord  === "and" || currentWord === "the" || currentWord === "of"
+      || currentWord === "in") {
+        words[i] = currentWord;
+      } else {
+        words[i]  = currentWord[0].toUpperCase() + currentWord.substring(1, currentWord.length);
+      }
+ }
+ return words.join(" ")
 }
 
 module.exports = correctTitle;

hard/gold-distribution/code.js

@@ -1,5 +1,16 @@
 function piratesKilled(gold, tolerance) {
-  // Your code here.
+  let max = 0;
+  for (let i = 0; i < gold.length; i++) {
+    if (max < gold[i])  {
+      max = gold[i]
+    }
+  }
+  for (let i = 0; i < gold.length; i++) {
+    if (tolerance[i] < (max - gold[i])) {
+      return true;
+    }
+  }
+  return false;
 }
 
 module.exports = piratesKilled;

hard/grocery-store-prices/code.js

@@ -1,5 +1,11 @@
 function getPrices(arr) {
-  // Your code here.
+  const prices = [];
+  for (let i = 0; i < arr.length; i++) {
+    prices.push(arr[i].match(/\(([^)]+)\)/)[1])
+    prices[i] =  parseFloat(prices[i].substr(1));
+  }
+
+  return prices;
 }
 
 module.exports = getPrices;

medium/a-pirate-s-tale/code.js

@@ -1,5 +1,17 @@
 function numberOfDays(coordinate) {
-  // Your code here.
+  let days = 0;
+  let daysTaken = 0;
+  for (let i = 0; i < coordinate.length; i++) {
+    if (coordinate[i] !== 0) {
+      if (days === 5) {
+        days = 0;
+        continue;
+      }
+
+      days++
+    }
+  }
+  return daysTaken;
 }
 
 module.exports = numberOfDays;

medium/accumulating-product/code.js

@@ -1,5 +1,11 @@
 function accumulatingProduct(arr) {
-  // Your code here.
+  let accumulate = 0;
+  const newArray = [];
+  for (let i = 0; i < arr.length; i++) {
+    accumulate *= arr[i];
+    newArray.push(accumulate);
+  }
+  return newArray;
 }
 
 module.exports = accumulatingProduct;

medium/algebra-sequence-boxes/code.js

@@ -1,5 +1,16 @@
 function boxSeq(step) {
-  // Your code here.
+  let currentNumber = 0;
+  if (step === 0) {
+    return currentNumber;
+  }
+  for(let i = 1; i <= step; i++) {
+    if (i % 2 === 1) {
+      currentNumber += 3
+    } else {
+      currentNumber -= 1;
+    }
+  }
+  return currentNumber;
 }
 
 module.exports = boxSeq;

medium/all-about-strings/code.js

@@ -1,5 +1,32 @@
 function allAboutStrings(str) {
-  // Your code here.
+  const arr = [];
+  const letters = [];
+  let repeat = false;
+  arr.push(str.length);
+  arr.push(str.substring(0, 1));
+  arr.push(str.substring(str.length - 1));
+  if(str.length % 2 === 1) {
+    arr.push(str.substr((str.length - 1) / 2, 1))
+  } else {
+    arr.push(str.substr(((str.length - 1) / 2), 2))
+  }
+
+  for (let i = 0; i < str.length; i++) {
+    if (letters.includes(str[i])) {
+      arr.push(`@ index ${i}`)
+      repeat = true;
+      break;
+    } else {
+      letters.push(str[i])
+    }
+  }
+
+  if (!repeat) {
+    arr.push("not found");
+  }
+
+  console.log(arr)
+  return arr;
 }
 
 module.exports = allAboutStrings;

medium/alternating-caps/code.js

@@ -1,5 +1,14 @@
 function alternatingCaps(str) {
-  // Your code here.
+  let word = ""
+  for (let i = 0; i < str.length; i++) {
+    const letter = str[i];
+    if (i % 2 === 0) {
+      word += letter.toUpperCase();
+    } else {
+      word += letter.toLowerCase();
+    }
+  }
+  return word;
 }
 
 module.exports = alternatingCaps;

medium/alternating-ones-and-zeroes/code.js

@@ -1,5 +1,19 @@
 function canAlternate(s) {
-  // Your code here.
+  let zeros = 0;
+  let ones = 0;
+  for (let i = 0; i < s.length; i++) {
+    if (s[i] === "0") {
+      zeros++;
+    } else {
+      ones++;
+    }
+  }
+  const difference = zeros - ones;
+  if (difference > 1 || difference < -1) {
+    return false;
+  } else {
+    return true;
+  }
 }
 
 module.exports = canAlternate;