| /** | |
| * Reverse a string of characters | |
| * | |
| * @function | |
| * @param {string} str A string of characters to reverse | |
| * @returns {string} The original string, but with the characters reversed | |
| */ | |
| function reverseString(str) { | |
| if (typeof str !== "string") { | |
| return undefined |
| /** | |
| * Manually merge two pre-sorted arrays. | |
| * | |
| * @function | |
| * @name mergeSortedArrays | |
| * @param {Array<*>} arrA The first list of values | |
| * @param {Array<*>} arrB The second list of values | |
| * @returns {Array<*>} The blend of both arrays of values | |
| */ | |
| function mergeSortedArrays(arrA = [], arrB = []) { |
| let varA = 42 | |
| let varB = 67 | |
| ([varB, varA] = [varA, varB]) |
| /** | |
| * Checks if a given numeric value is an integer | |
| * | |
| * @function | |
| * @name isInteger | |
| * @param {number} val A value to verify is an integer | |
| * @returns {boolean} Whether or not the given value is an integer | |
| */ | |
| function isInteger(val) { | |
| return typeof val === "number" |
| /** | |
| * There isn't a strong need for de-duplicating an array in JavaScript nowadays with `Set` now native to the language. | |
| * For the sake of computer science exercise, other techniques are expected. | |
| * But pragmatically, just use a `Set` and convert it back to an `Array` afterwards. Easy. | |
| * | |
| * @function | |
| * @name uniq | |
| * @param {Array<*>} arr A list of values (may contain duplicates) | |
| * @returns {Array<*>} The original list of values, but with any duplicates removed. | |
| */ |
| /** | |
| * Retrieve the "nth" number in a fibonacci series. | |
| * | |
| * @function | |
| * @param {number} nth In an ordered fibonacci series, this represents the index at which to pluck a value out of the series. | |
| * @returns {number|undefined} The value corresponding to the provided (zero based) index | |
| */ | |
| function fibonacciNumber(nth) { | |
| /* Bail out if the index isn't valid */ | |
| if (!Number.isInteger(nth) || nth < 0) { |
| /** | |
| * Calculates the sum of all the (positive) numbers between zero and a given number. | |
| * | |
| * @function | |
| * @name fibonacciSeries | |
| * @param {number} ceiling The threshold at which to end the sum | |
| * @returns {Array<number>} The (fibonacci) series of all the positive values between zero and the ceiling. | |
| */ | |
| function fibonacciSeries(ceiling) { | |
| /* Bail out if the ceiling isn't valid */ |
| /** | |
| * Checks if a given numeric value is an integer | |
| * | |
| * @function | |
| * @name isInteger | |
| * @param {number} val A value to verify is an integer | |
| * @returns {boolean} Whether or not the given value is an integer | |
| */ | |
| function isInteger(val) { | |
| return typeof val === "number" |
Incorporate small learning chunks into Sprint planning, and a 5min recap of it at the end of Sprint.
Goals: