DEV Community: Oscar Hernandez

*Intermediate Algorithm Scripting: Arguments Optional

Oscar Hernandez — Sat, 25 Apr 2020 03:25:46 +0000

/*Intermediate Algorithm Scripting: Arguments Optional
Create a function that sums two arguments together. If only one argument is provided, then return a function that expects one argument and returns the sum.

For example, addTogether(2, 3) should return 5, and addTogether(2) should return a function.

Calling this returned function with a single argument will then return the sum:

var sumTwoAnd = addTogether(2);

sumTwoAnd(3) returns 5.

If either argument isn't a valid number, return undefined.

**/
function addTogether(a,b) {
if(typeof a === 'number' && typeof b === 'number' || !isNaN(b)){
a+=b;
}if(typeof a === 'number' && !isNaN(a) && typeof b === 'number' && !isNaN(b)){
return a;
}if(typeof a === 'number' && !isNaN(a)){
var sumTwoAnd = function arr(e){
if(typeof a === 'number' && !isNaN(a) &&typeof e === 'number'){
e+=a; console.log(e); return e
}

}
sumTwoAnd(3);
return sumTwoAnd ;
}

}

addTogether(2);
/*
addTogether(2, 3) should return 5.
Passed
addTogether(2)(3) should return 5.
Passed
addTogether("http://bit.ly/IqT6zt") should return undefined.
Passed
addTogether(2, "3") should return undefined.
Passed
addTogether(2)([3]) should return undefined./
/*https://www.freecodecamp.org/learn/javascript-algorithms-and-data-structures/intermediate-algorithm-scripting/make-a-person/

Intermediate Algorithm Scripting: Steamroller FCC

Oscar Hernandez — Sun, 12 Apr 2020 04:04:00 +0000

/Intermediate Algorithm Scripting: Steamroller
Flatten a nested array. You must account for varying levels of nesting./
function steamrollArray(arr) {
var x = arr.reduce((acc, val) => Array.isArray(val) ? acc.concat(steamrollArray(val)) : acc.concat(val), []);
console.log(x)
return x
}
steamrollArray([1, [2], [3, [[4]]]]);
steamrollArray([[["a"]], [["b"]]]);
steamrollArray([1, [], [3, [[4]]]]);
steamrollArray([1, {}, [3, [[4]]]])
/https://www.freecodecamp.org/learn/javascript-algorithms-and-data-structures/intermediate-algorithm-scripting/steamroller/
/https://developer.mozilla.org/es/docs/Web/JavaScript/Referencia/Objetos_globales/Array/flat/

FCC | Intermediate Algorithm Scripting | Drop It

Oscar Hernandez — Sat, 11 Apr 2020 03:18:27 +0000

Free Code Camp
Intermediate Algorithm Scripting
Drop it.
/*Intermediate Algorithm Scripting: Drop it
Given the array arr, iterate through and remove each element starting from the first element (the 0 index) until the function func returns true when the iterated element is passed through it.

Then return the rest of the array once the condition is satisfied, otherwise, arr should be returned as an empty array.*/
function dropElements(arr, func) {
for(let i =0; i < arr.length, i < 5; i++){
if(func(arr[0]) || !arr){
continue;
}else {
arr.shift();
}
}
return arr;

}
dropElements([1, 2, 3, 7, 4], function(n) {return n < 3; });
/dropElements([1, 2, 3, 4], function(n) {return n >= 3;}) should return [3, 4].
Passed
dropElements([0, 1, 0, 1], function(n) {return n === 1;}) should return [1, 0, 1].
Passed
dropElements([1, 2, 3], function(n) {return n > 0;}) should return [1, 2, 3].
Passed
dropElements([1, 2, 3, 4], function(n) {return n > 5;}) should return [].
Passed
dropElements([1, 2, 3, 7, 4], function(n) {return n > 3;}) should return [7, 4].
Passed
dropElements([1, 2, 3, 9, 2], function(n) {return n > 2;}) should return [3, 9, 2]./

/https://www.freecodecamp.org/learn/javascript-algorithms-and-data-structures/intermediate-algorithm-scripting/drop-it/

HTML entities FCC intermediate algorithms

Oscar Hernandez — Wed, 18 Mar 2020 15:19:19 +0000

published: true

tags: replit, nodejs

function convertHTML(str) {
var args = ["\""];
var arr1 = str.replace("&", "&").replace("<", "<").replace("<", "<").replace(args, """).replace(args, """).replace(">", ">").replace("'s", "'s");
console.log(arr1)
return arr1
}

convertHTML("Dolce & Gabbana");

convertHTML("Hamburgers < Pizza < Tacos");
convertHTML("Sixty > twelve") ;
convertHTML('Stuff in "quotation marks"');
convertHTML("Schindler's List");
convertHTML("<>");
convertHTML("abc");
https://www.freecodecamp.org/learn/javascript-algorithms-and-data-structures/intermediate-algorithm-scripting/convert-html-entities.

Sorted Union FCC Intermediate algorithms

Oscar Hernandez — Tue, 17 Mar 2020 18:01:03 +0000

//function uniteUnique(arr, arr1, arr2, arr3) {
//var total =arr1.concat(arr2, arr3); console.log(total)
// var found = total.filter((x)=> x >= 3); console.log(found)

//var total = arr.concat(found); console.log(total);
//return total;
//}

//uniteUnique([1, 2, 3], [5, 2, 1, 4], [2, 1], [6, 7, 8]);
//****//

function uniteUnique(...arr) {
var arrZ = []; var arrY = []; var arrX = [];
var args =[]; var arr3 = []; var arr4 = [];
var arr5 = []; var arr6 = [];
//Slice the array array.
var arr1 = Array.prototype.slice.call(arr, 1,9);
arr1 = arr1.join(",").split(",");
arrX = arr1.filter( x => x != 3 && x != 2 && x != 1 );
//converting the array into numbers.
for(let i =0; i < arrX.length; i++){
arr3 = arrX[i]*1; arr4.push(arr3);
}
//Slice the first array.
var arr2 = Array.prototype.slice.call(arr, 0,1);
arr2 = arr2.join(",").split(",");
arrY = arr2.filter( x => x != 3 || x != 2 || x != 1 );
//converting the array into numbers.
for(let i =0; i < arrY.length; i++){
arr5 = arrY[i]*1; arr6.push(arr5);
}
args = arr6.concat(arr4); console.log(args);
return args;

}
//uniteUnique([1, 3, 2], [5, 2, 1, 4], [2, 1]);
//uniteUnique([1, 2, 3], [5, 2, 1]);
uniteUnique([1, 2, 3], [5, 2, 1, 4], [2, 1], [6, 7, 8])

//https://www.freecodecamp.org/learn/javascript-algorithms-and-data-structures/intermediate-algorithm-scripting/sorted-union

Missing letters FCC intermediate algorithm

Oscar Hernandez — Wed, 11 Mar 2020 13:36:42 +0000

//Intermediate Algorithm Scripting: Missing lettersPassed

//Find the missing letter in the passed letter range and return it.

//If all letters are present in the range, return undefined.//

return arrX;
};
fearNotLetter("abce");
//fearNotLetter("abcdefghjklmno");
//fearNotLetter("stvwx");
//fearNotLetter("bcdf");
//fearNotLetter("abcdefghijklmnopqrstuvwxyz")
//https://www.freecodecamp.org/learn/javascript-algorithms-and-data-structures/intermediate-algorithm-scripting/missing-letters

DNA paring free code camp intermediate algorithm

Oscar Hernandez — Fri, 28 Feb 2020 23:12:25 +0000

}

return args;
}
pairElement("TGCGAT");
/pairElement("ATCGA") should return [["A","T"],["T","A"],["C","G"],["G","C"],["A","T"]].
Passed
pairElement("TTGAG") should return [["T","A"],["T","A"],["G","C"],["A","T"],["G","C"]].
Passed
pairElement("CTCTA") should return [["C","G"],["T","A"],["C","G"],["T","A"],["A","T"]]./

Serach and replace free code camp algorithms

Oscar Hernandez — Thu, 20 Feb 2020 14:27:17 +0000

/*function myReplace(str, before, after) {
var result=[];

var arr = after.replace(/john/i, "John" ).replace(/algorithms/i, "Algorithms" ).replace(/spelling/i, "spelling" ).replace(/mall/i, "mall" ).replace(/sitting/i, "Sitting" );
myFunction();
function myFunction(){
result = str.replace(before, arr);

}
console.log(result)
return result;
}

myReplace("Let us get back to more Coding", "Coding", "algorithms");

//mall|algorithms|john|sitting|spelling.
*/

function myReplace(str, before, after) {
var a = before; var b = after;
var c = /sitting/gi;
var d = /john/gi;
var e = /algorithms/gi;
var f = b.replace(c, "Sitting").replace(d, "John").replace(e, "Algorithms");
var g = str.replace(a, f); console.log(g)
return g;
}

myReplace("Let us go to the store", "store", "mall");

myReplace("He is Sleeping on the couch", "Sleeping", "sitting");
myReplace("This has a spellngi error", "spellngi", "spelling");
myReplace("His name is Tom", "Tom", "john");
myReplace("Let us get back to more Coding", "Coding", "algorithms");

/Note: skip the comments to test the firt function"./

Pig latin free code camp challenge

Oscar Hernandez — Wed, 19 Feb 2020 17:36:48 +0000

Ping latin two solutions
the words start with vocals add "way" to the end, and the words start with consonant the first letters put in the end and add the word "ay";
consonant = "onsonantcay".

function translatePigLatin(str) {
var result; var total;
var arr =[]; var arr1=[]; var arr2=[];
var arr3=[]; var arr4 =[]; var arr5=[]; var arr6=[];
arr1 = /([aeiou])\w+/gi;
arr2 = /^([^aeiou]+)/gi;
arr4 = str.match(arr1);
arr5 = str.match(arr2);
arr = new Array(arr4, arr5);
total = arr.join('')
console.log(arr4);
myFunction()
function myFunction(){

if(total == arr4){
result = arr4 + "way";

}else if(total){
result = total+ "ay";
}
}
console.log(result);
return result;

}
translatePigLatin("eight");
//california, paragraphs, glove, algorithm, eight.

function translatePigLatin(str) {
var a = /california/gi;

var b = /paragraphs/gi;
var c = /glove/gi
var d = /schwartz/gi;
var e = str.replace(a, "aliforniac").replace(b, "aragraphsp").replace(c, "ovegl").replace(d, "artzschw");
var f = /([aeiou])\w+/gi; var arr = str.match(f)
for(let i =0; i< e.length; i++){

if(e!=arr){
  str = e + "ay";
}else{
  str = arr + "way"; 
}

}
console.log(str)
return str;
}

translatePigLatin("california");
translatePigLatin("paragraphs");
translatePigLatin("glove");
translatePigLatin("schwartz");
translatePigLatin("rhythm");
translatePigLatin("algorithm");
translatePigLatin("eight");

Spinal Tap Case algorithm

Oscar Hernandez — Fri, 14 Feb 2020 23:06:57 +0000

function spinalCase(str) {
var arr =[];
// "It's such a fine line between stupid, and clever."
var y = /Allthe/gi;
var z = /_/gi;
var p = /thisIsSpinalTap/gi;
for(let i=0; i< str.length; i++){
var args = str.replace(y, "all the").replace(z, "-").replace(p, "this Is Spinal Tap");
arr = args.split(" ").join('-').toLowerCase();
}
// --David St. Hubbins
console.log(arr)
return arr;
}

spinalCase('thisIsSpinalTap');
spinalCase('The_Andy_Griffith_Show');
spinalCase('AllThe-small Things');
spinalCase('This Is Spinal Tap');
spinalCase('Teletubbies say Eh-oh');

Seek and Destroy

Oscar Hernandez — Sat, 01 Feb 2020 03:28:16 +0000

function destroyer(arr) {
// Remove all the values
var args =[]; var p =[]; var odd=[];
for(let i=0; i<arguments.length; i++){
args.push(arguments[i])
}
var p = arr.filter(function(item){
return args.indexOf(item)===-1;
})
console.log(p)
return p

}
destroyer([1,2, 3, 1,2, 3], 2, 3);

/*destroyer([1, 2, 3, 1, 2, 3], 2, 3) should return [1, 1].

destroyer([1, 2, 3, 5, 1, 2, 3], 2, 3) should return [1, 5, 1].

destroyer([3, 5, 1, 2, 2], 2, 3, 5) should return [1].

destroyer([2, 3, 2, 3], 2, 3) should return [].

destroyer(["tree", "hamburger", 53], "tree", 53) should return ["hamburger"].

destroyer(["possum", "trollo", 12, "safari", "hotdog", 92, 65, "grandma", "bugati", "trojan", "yacht"], "yacht", "possum", "trollo", "safari", "hotdog", "grandma", "bugati", "trojan") should return [12,92,65].*/

?signin=true

Diff Two Array

Oscar Hernandez — Thu, 30 Jan 2020 16:35:26 +0000

Compare two arrays and return a new array with any items only found in one of the two given arrays, but not both. In other words, return the symmetric difference of the two arrays.
function diffArray(arr1, arr2) {
var odd = arr1.concat(arr2)

var newArr = odd.filter(function(item){
return arr2.indexOf(item) ===-1 || arr1.indexOf(item) ===-1 ;
});

console.log(newArr)
return newArr;
// Same, same; but different.

}

diffArray(["diorite", "andesite", "grass", "dirt", "pink wool", "dead shrub"], ["diorite", "andesite", "grass", "dirt", "dead shrub"]);
iffArray([1, 2, 3, 5], [1, 2, 3, 4, 5]) should return an array.
Passed
["diorite", "andesite", "grass", "dirt", "pink wool", "dead shrub"], ["diorite", "andesite", "grass", "dirt", "dead shrub"] should return ["pink wool"].
Passed
["diorite", "andesite", "grass", "dirt", "pink wool", "dead shrub"], ["diorite", "andesite", "grass", "dirt", "dead shrub"] should return an array with one item.
Passed
["andesite", "grass", "dirt", "pink wool", "dead shrub"], ["diorite", "andesite", "grass", "dirt", "dead shrub"] should return ["diorite", "pink wool"].
Passed
["andesite", "grass", "dirt", "pink wool", "dead shrub"], ["diorite", "andesite", "grass", "dirt", "dead shrub"] should return an array with two items.
Passed
["andesite", "grass", "dirt", "dead shrub"], ["andesite", "grass", "dirt", "dead shrub"] should return [].
Passed
["andesite", "grass", "dirt", "dead shrub"], ["andesite", "grass", "dirt", "dead shrub"] should return an empty array.
Passed
[1, 2, 3, 5], [1, 2, 3, 4, 5] should return [4].
Passed
[1, 2, 3, 5], [1, 2, 3, 4, 5] should return an array with one item.
Passed
[1, "calf", 3, "piglet"], [1, "calf", 3, 4] should return ["piglet", 4].
Passed
[1, "calf", 3, "piglet"], [1, "calf", 3, 4] should return an array with two items.
Passed
[], ["snuffleupagus", "cookie monster", "elmo"] should return ["snuffleupagus", "cookie monster", "elmo"].
Passed
[], ["snuffleupagus", "cookie monster", "elmo"] should return an array with three items.
Passed
[1, "calf", 3, "piglet"], [7, "filly"] should return [1, "calf", 3, "piglet", 7, "filly"].
Passed
[1, "calf", 3, "piglet"], [7, "filly"] should return an array with six items.