Quote with Twitter Demo
Posted on May 14, 2018 in JavaScript, jQuery, WordPress by Matt Jennings
This is an example quote!
Blog
Archive for the JavaScript Category
Quote with Twitter Demo
Determine if a String Contains a Palindrome in JavaScript
Posted on December 7, 2017 in Algorithms, JavaScript, Regular Expressions by Matt Jennings
Determine if a string contains a palindrome in JavaScript.
Strip out any non Latin alphabetic characters if needed.
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 | var str = '!Noel - sees Leon'; function getPalinedrome(str) { var str1 = str.replace(/[^a-z]/gi, '').toLowerCase(); var str1Reverse = str1.split('').reverse().join(''); if(str1 === str1Reverse) { return true; } else { return false; } } // Output true console.log(getPalinedrome(str)); |
In JavaScript Sort Numbers using the sort() Function
Posted on November 28, 2017 in Algorithms, JavaScript by Matt Jennings
Sort Numbers In Ascending Order
1 2 3 4 5 6 7 8 9 10 11 | var numbers = [2, 1, 111, 222, 33, -2]; // Output is [-19, -2, 1, 33, 111, 222] // because the 'return a - b' code below // means that in the array above // 2 (index 0) is subtracted 1 (index 1) // and since this number is positive // 2 is moved in front of 1 and so on console.log(numbers.sort(function(a,b) { return a - b; })); |
Sort Numbers in Descending Order
1 2 3 4 5 6 7 8 9 10 11 | var numbers = [2, 1, 111, 222, 33, -2]; // Output is [222, 111, 33, 2, 1, -2] // because the 'return b - a' code below // means that in the array above // 1 (index 1) is subtracted 2 (index 0) // and since this number is negative // 2 stays in front of 1 and so on console.log(numbers.sort(function(a,b) { return b - a; })); |
In JavaScript Show Longest Word in a String
Posted on November 28, 2017 in Algorithms, JavaScript, Regular Expressions by Matt Jennings
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 | function longestWord(sen) { // 'sen' is a string and 'match' // matches all the items in the // 'sen' string (per the regex) // an array of matched parts of the string. // The '/a-z0-9+/gi' regular expression // matches a part of the string with letters or numbers // case insentively (the 'i') and // globally (the 'g') which means that // not ONLY the first matching array element // will be returned and the '+' means // that a matching part of the string // will have one or more letters and/or numbers // matching. var arr = sen.match(/[a-z0-9]+/gi); // The function below returns an array of sorted // elements from the longest length element to the // shortest length element. If two elements // are of equal length then the array element that // comes first is sorted before the element // that came second. var sorted = arr.sort(function(a, b) { return b.length - a.length; }); // The first element of the 'sorted' array is returned // because it is either the longest length array element // or tied for the longest length array element. return sorted[0]; } // Output is "coderbyte999" console.log(longestWord("the $$$longest# word is coderbyte999")); |
Determine If a Positive Integer is a Prime Number Using JavaScript
Posted on November 27, 2017 in Algorithms, JavaScript by Matt Jennings
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 | function getPrimeNumber(num) { var arr = []; for(var i = 1; i < num + 1; i++) { if(num === 1) { return false; } else if(num % i === 0) { arr.push(i); } } if( arr.length > 2 ) { return false } else if(arr.length === 2) { return true; } } // Output is true because 19 is a prime number console.log(getPrimeNumber(19)); |