This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
// Using a while loop | |
function factorialize(num) { | |
if (num == 0){ | |
return 1; | |
} | |
var result = 1; | |
while (num>0){ | |
result *= num; |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
// Using a for loop and reduce(); not the simplest solution but succesful first attempt. | |
function factorialize(num) { | |
if (num == 0){ | |
return 1; | |
} | |
var arr = []; | |
for (i=num; i>0; i--){ | |
arr.push(i); | |
} |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
//Requirements: lowercase, non-alphanumeric chars + no underscores | |
function palindrome(str) { | |
str = str.toLowerCase(); | |
str = str.replace(/\W/g, ""); //Remove all non-alphanumeric chars | |
str = str.replace(/_/g, ""); //Remove all underscore chars | |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
function findLongestWord(str) { | |
//Split input by spaces | |
var a = str.split(" "); // Use /\W|_/ instead to match non alphanumeric or underscore chars | |
//New array for lengths | |
var b = []; // c=""; for later returning which one (not needed for this exercise) | |
for (i=a.length-1; i>=0 ; i--){ |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
function titleCase(str) { | |
var a = str.split(' '), word=[]; //Split input and create new array var | |
for (i=a.length-1; i>=0; i--){ | |
a[i] = a[i].toLowerCase(); //Lowercase everything | |
word[i] = a[i].charAt(0).toUpperCase() + a[i].substr(1,a[i].length-1); /*Uppercase just the first char on every word and put the rest of the word after it. | |
a[i].length-1 is optional according to MDN and will extract characters to the end of the string too*/ | |
} | |
return word.join(" "); //Join and return new string |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
function largestOfFour(arr) { | |
for (i=arr.length-1; i>=0; i--){ | |
arr[i] = Math.max.apply(null, arr[i]); // I was thinking on doing it with max and reduce buy this looks cleaner | |
// Using ES6's spread operator: arr[i] = Math.max(...arr[i]); | |
} | |
return arr; | |
} | |
largestOfFour([[4, 5, 1, 3], [13, 27, 18, 26], [32, 35, 37, 39], [1000, 1001, 857, 1]]); |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
function confirmEnding(str, target) { | |
return str.substr(-target.length) === target; | |
// With the substring() method: return str.substring(str.length - target.length) === target; | |
// Using the endsWith() method: return str.endsWith(target); | |
} |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
function repeatStringNumTimes(str, num) { | |
if (num < 0){return "";} | |
var res=""; | |
for (i=num; i>0; i--){ | |
res+=str; | |
} | |
return res; | |
//Using recursion: return str + repeatStringNumTimes(str, num-1); | |
} |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
function truncateString(str, num) { | |
if (num <= 3) { | |
return str.substr(0, num) + '...'; | |
} | |
if (num >= str.length) { | |
return str; | |
} | |
return str.substr(0, num - 3) + '...'; | |
} |
OlderNewer