Calculates the greatest common denominator (gcd) of an array of numbers.
-Use Array.reduce() and the gcd formula (uses recursion) to calculate the greatest common denominator of an array of numbers.
const arrayGcd = arr => {
- const gcd = (x, y) => (!y ? x : gcd(y, x % y));
- return arr.reduce((a, b) => gcd(a, b));
-};
-arrayGcd([1, 2, 3, 4, 5]); // 1
-arrayGcd([4, 8, 12]); // 4
-Calculates the lowest common multiple (lcm) of an array of numbers.
-Use Array.reduce() and the lcm formula (uses recursion) to calculate the lowest common multiple of an array of numbers.
const arrayLcm = arr => {
- const gcd = (x, y) => (!y ? x : gcd(y, x % y));
- const lcm = (x, y) => x * y / gcd(x, y);
- return arr.reduce((a, b) => lcm(a, b));
-};
-arrayLcm([1, 2, 3, 4, 5]); // 60
-arrayLcm([4, 8, 12]); // 24
-Returns the maximum value in an array.
-Use Math.max() combined with the spread operator (...) to get the maximum value in the array.
const arrayMax = arr => Math.max(...arr);
-arrayMax([10, 1, 5]); // 10
-Returns the minimum value in an array.
-Use Math.min() combined with the spread operator (...) to get the minimum value in the array.
const arrayMin = arr => Math.min(...arr);
-arrayMin([10, 1, 5]); // 1
-Chunks an array into smaller arrays of a specified size.
Use Array.from() to create a new array, that fits the number of chunks that will be produced.
Use Array.slice() to map each element of the new array to a chunk the length of size.
@@ -1072,19 +1033,12 @@ runPromisesInSeries([() => delay(1000), () => delay(2000)]); // //executes
negate(isOdd)(1); // false
Returns the average of an array of numbers.
+Returns the average of an of two or more numbers/arrays.
Use Array.reduce() to add each value to an accumulator, initialized with a value of 0, divide by the length of the array.
const arrayAverage = arr => arr.reduce((acc, val) => acc + val, 0) / arr.length;
+const average = (...arr) => [].concat(...arr).reduce((acc, val) => acc + val, 0) / arr.length;
-arrayAverage([1, 2, 3]); // 2
-
-Returns the sum of an array of numbers.
-Use Array.reduce() to add each value to an accumulator, initialized with a value of 0.
const arraySum = arr => arr.reduce((acc, val) => acc + val, 0);
-arraySum([1, 2, 3, 4]); // 10
+average([1, 2, 3]); // 2
Clamps num within the inclusive range specified by the boundary values a and b.
fibonacciCountUntilNum(10); // 7
Calculates the greatest common divisor between two numbers.
-Use recursion. +
Calculates the greatest common divisor between two or more numbers/arrays.
+The helperGcdfunction uses recursion.
Base case is when y equals 0. In this case, return x.
Otherwise, return the GCD of y and the remainder of the division x/y.
const gcd = (x, y) => (!y ? x : gcd(y, x % y));
+const gcd = (...arr) => {
+ let data = [].concat(...arr);
+ const helperGcd = (x, y) => (!y ? x : gcd(y, x % y));
+ return data.reduce((a, b) => helperGcd(a, b));
+};
gcd(8, 36); // 4
@@ -1241,15 +1199,56 @@ Return false if any of them divides the given number, else return <
isPrime(12); // false
Returns the least common multiple of two numbers.
+Returns the least common multiple of two or numbers/arrays.
Use the greatest common divisor (GCD) formula and Math.abs() to determine the least common multiple.
The GCD formula uses recursion.
const lcm = (x, y) => {
+const lcm = (...arr) => {
+ let data = [].concat(...arr);
const gcd = (x, y) => (!y ? x : gcd(y, x % y));
- return Math.abs(x * y) / gcd(x, y);
+ const helperLcm = (x, y) => x * y / gcd(x, y);
+ return arr.reduce((a, b) => helperLcm(a, b));
};
lcm(12, 7); // 84
+lcm([1, 3, 4], 5); // 60
+
+Returns the maximum value out of two or more numbers/arrays.
+Use Math.max() combined with the spread operator (...) to get the maximum value in the array.
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+const max = (...arr) => Math.max(...[].concat(...arr);
+max([10, 1, 5]); // 10
Returns the median of an array of numbers.
@@ -1264,6 +1263,13 @@ Return the number at the midpoint iflength is odd, otherwise the a
median([5, 6, 50, 1, -5]); // 5
median([0, 10, -2, 7]); // 3.5
Returns the minimum value in an array.
+Use Math.min() combined with the spread operator (...) to get the minimum value in the array.
const min = arr => Math.min(...[].concat(...arr));
+min([10, 1, 5]); // 1
+Returns true if the given string is a palindrome, false otherwise.
Convert string toLowerCase() and use replace() to remove non-alphanumeric characters from it.
@@ -1349,6 +1355,13 @@ You can omit the second argument to get the sample standard deviation or set it
standardDeviation([10, 2, 38, 23, 38, 23, 21]); // 13.284434142114991 (sample)
standardDeviation([10, 2, 38, 23, 38, 23, 21], true); // 12.29899614287479 (population)
Returns the sum of an of two or more numbers/arrays.
+Use Array.reduce() to add each value to an accumulator, initialized with a value of 0.
const sum = (...arr) => [].concat(...arr).reduce((acc, val) => acc + val, 0);
+sum([1, 2, 3, 4]); // 10
+Performs speech synthesis (experimental).
diff --git a/scripts/build-script.js b/scripts/build-script.js index 891b51cce..61d1c693b 100644 --- a/scripts/build-script.js +++ b/scripts/build-script.js @@ -73,7 +73,7 @@ try { if(capitalize(tag, true)=='Uncategorized') { uncategorizedOutput +=`## _${capitalize(tag, true)}_\n`; for(let taggedSnippet of Object.entries(tagDbData).filter(v => v[1] === tag)) - uncategorizedOutput += `\n${snippets[taggedSnippet[0]+'.md']+'\n[⬆ back to top](#table-of-contents)\n'}`; + uncategorizedOutput += `\n${snippets[taggedSnippet[0]+'.md']+'\n