Project Freecode - Basic Alghoritm

Author: PabloGBarcelo

bouncer.js

@@ -0,0 +1,7 @@
+function bouncer(arr) {
+  // Don't show a false ID to this bouncer
+  return arr.filter(Boolean);
+  //return arr;
+}
+
+bouncer([7, "ate", "", false, 9]);

chunkymonkey.js

@@ -0,0 +1,18 @@
+function chunkArrayInGroups(arr, size) {
+  // Break it up.
+  var arrTempo = [];
+  var numVueltas = Math.ceil(arr.length/size);
+  console.log("numero de vueltas: "+ Math.ceil(arr.length/size));
+  while(arr.length>0){
+    //for(var cont = 0; cont < size; cont++){
+
+    //}
+    arrTempo.push(arr.splice(0,size));
+    console.log("Ahora ArrTempo vale"+arrTempo);
+  }
+  console.log("arrTempo vale: "+arrTempo);
+  return arrTempo;
+}
+
+//chunkArrayInGroups(["a", "b", "c", "d"], 2);
+chunkArrayInGroups([0, 1, 2, 3, 4, 5], 2);

compareEndingString.js

@@ -0,0 +1,10 @@
+function confirmEnding(str, target) {
+  // "Never give up and good luck will find you."
+  // -- Falcor
+  var stringToCompare = str.substring(str.length-target.length,str.length);
+  return stringToCompare == target ? true : false;
+  // Simplified
+  //return str.substring(str.length-target.length,str.length) == target ? true: false;
+}
+
+confirmEnding("Bastian", "n");

factorial.js

@@ -0,0 +1,10 @@
+function factorialize(num) {
+  var total=1;
+  for (var x = 1; x<=num;x++){
+    console.log("total vale "+total+" * "+x);
+    total *= x;
+  }
+  return total;
+}
+
+factorialize(5);

largestOfFour.js

@@ -0,0 +1,21 @@
+function largestOfFour(arr) {
+  // You can do this!
+  // MAP Create new array with values.
+  return arr.map(function(listNumbers){
+    // REDUCE go through listNumbers values comparing until finish with the
+    // bigger of them.
+    return listNumbers.reduce(function(antNum,postNum){
+      // ALTERNATIVE return postNum > antNum ? postNum : antNum;
+      if (postNum > antNum){
+        console.log ("Devolviendo: "+postNum);
+        return postNum;
+      }
+      else{
+        console.log ("Devolviendo: "+antNum);
+        return antNum;
+      }
+    }, 0);
+  });
+}
+
+largestOfFour([[4, 5, 1, 3], [13, 27, 18, 26], [32, 35, 37, 39], [1000, 1001, 857, 1]]);

longest-word-string.js

@@ -0,0 +1,13 @@
+function findLongestWord(str) {
+  var arrWord = str.split(" ");
+  str = "";
+  arrWord.map(function(word){
+    if(word.length>str.length){
+      str = word;
+    }
+  });
+
+  return str.length;
+}
+
+findLongestWord("The quick brown fox jumped over the lazy dog");

mutation.js

@@ -0,0 +1,15 @@
+function mutation(arr) {
+  for (var cont = 0; cont < arr[1].length; cont++){
+
+    if(arr[0].toLowerCase().indexOf(arr[1][cont].toLowerCase()) == -1){
+
+      return false;
+
+    }
+
+  }
+    return true;
+  //return arr;
+}
+
+mutation(["hello", "hey"]);

palindrome.js

@@ -0,0 +1,19 @@
+function palindrome(str) {
+  // Good luck!
+   // Same as input.replace(/\W/g, '')
+  var newString = str.replace(/[^0-9a-z]/gi, '');
+  var compareString;
+  newString = newString.toLowerCase();
+  console.log("newstring vale: "+newString);
+  compareString = newString.split('').reverse().join('');
+  if (compareString == newString){
+    return true;
+  }
+  else{
+    return false;
+  }
+
+}
+
+palindrome("0_0 (: /-\ :) 0-0");
+palindrome("eye");

repeatStringNumTimes.js

@@ -0,0 +1,16 @@
+function repeatStringNumTimes(str, num) {
+  // repeat after me
+  if (num < 1){
+    return "";
+  }else{
+
+    var newString ="";
+    for (var count = 0; count < num; count++){
+      newString = newString.concat(str);
+    }
+    return newString;
+  }
+
+}
+
+repeatStringNumTimes("abc", 3);

reverseString.js

@@ -0,0 +1,11 @@
+function reverseString(str) {
+  // Convert into an array
+  var strSplitted = str.split("");
+  // Reverse array
+  strSplitted = strSplitted.reverse();
+  // Join
+  str = strSplitted.join("");
+  return str;
+}
+
+reverseString("hello");

seekAndDestroyer.js

@@ -0,0 +1,14 @@
+function destroyer(arr) {
+  // Remove all the values
+
+  var arrayToCompare = Array.from(arguments).slice(1);
+  return arr.filter(function(word){
+    //console.log("Comparando arr: "+word+" con arrayToCompare");
+    return !arrayToCompare.includes(word);
+  });
+}
+
+function isIncludedOn(arr){
+
+}
+destroyer([1, 2, 3, 1, 2, 3], 2, 3);

slasher.js

@@ -0,0 +1,7 @@
+function slasher(arr, howMany) {
+  // it doesn't always pay to be first
+  console.log("Valor "+arr.slice(howMany,arr.length));
+  return arr.slice(howMany,arr.length);
+}
+
+slasher([1, 2, 3], 2);

title-case.js

@@ -0,0 +1,13 @@
+function titleCase(str) {
+  var newString = str.split(" ");
+  var newArrayString = [];
+  newString.map(function(word){
+  console.log("analizando: "+word);
+    newArrayString.push(word.charAt(0).toUpperCase() + word.slice(1).toLowerCase());
+  });
+  console.log("newarraystring: "+newArrayString);
+  str = newArrayString.join(" ");
+  return str;
+}
+
+titleCase("I'm a little tea pot");

truncateString.js

@@ -0,0 +1,20 @@
+function truncateString(str, num) {
+  // Clear out that junk in your trunk
+  if (num >=1){
+    if (str.length < 3){
+      return str.substring(0,1)+"...";
+    }
+    else if (num <=3){
+      return str.substring(0,num)+"...";
+    }
+    else if (str.length <= num){
+      return str;
+    }
+    else if (str.length > num){
+      return str.substring(0,num-3)+"...";
+    }
+  }
+
+}
+
+truncateString("A-tisket a-tasket A green and yellow basket", 11);

whereDoIBelong.js

@@ -0,0 +1,40 @@
+
+function getIndexToIns(arr, num) {
+  // Find my place in this sorted array.
+  var arr2=[];
+  var arr3="";
+  arr.sort(function (a, b) {  return a - b;  });
+  //console.log("Analizando arr: "+arr+" con num "+num);
+  for(var cont = 0; cont < arr.length; cont++){
+    if (arr[cont] >= num){
+      arr3=cont;
+      break;
+    }else{
+      arr3=arr.length;
+    }
+  }
+  return arr3;
+  /* FIRST TRY
+  arr.reduce(function(val,actNum,index){
+    if (val == num && index==1){
+      console.log("Estoy devolviendo 0");
+      arr2.push(0);
+      return 0;
+    }
+    while (actNum >= num){
+      arr2.push(index);
+      return index;
+    }
+  });
+  //return num;
+  if (arr2.length == 0){
+    return arr.length;
+  }
+  else{
+    return arr2[0];
+  }
+  */
+
+}
+
+getIndexToIns([40, 60], 50);