petergi

/**
 * Calculates the standard deviation of an array of numbers.
 *
 * @param {Array} arr - The array of numbers.
 * @param {Boolean} usePopulation - Optional. If true, the function uses the population standard deviation formula. Default is false, which uses the sample standard deviation formula.
 * @return {Number} - The standard deviation of the array.
 */
const standardDeviation = (arr, usePopulation = false) => {
    const n = arr.length
    let sum = 0

petergi

Curl cheatsheet

Options

-o <file>    # --output: write to file
-u user:pass # --user: Authentication
-v           # --verbose
-vv          # Even more verbose
-s           # --silent

petergi

/**
 * Sorts an array using the heapsort algorithm.
 * Heapsort is a comparison-based sorting algorithm.
 * Heapsort is an improved selection sort consisting of the use of a
 * heap data structure instead of a linear-time search to find the maximum or minimum element.
 *
 * @param {Array} arr - The array to be sorted.
 * @return {Array} - The sorted array.
 */
function heapsort(arr) {

petergi

/**
 * Generates a list of strings based on the given integer input.
 *
 * @param  n  the maximum integer value to generate strings for
 * @return    a list of strings containing the generated values
 */
public List<String> fizzBuzz(int n) {
    List<String> res = new ArrayList<>(n)
    for (int i = 1; i <= n; i++) {
        StringBuilder sb = new StringBuilder()

petergi

title	tags	excerpt	dateModified
JS Big-O Cheat Sheet	algorithm	Learn everything you need to know about Big-O notation with this handy cheatsheet.	2023-01-08 05:00:00 -0400

Definition

petergi

let asciiValue: String = "1234567890ABCDEFGHIJ"

func asciiToHex(_ asciiValue: String) -> String {
    let chars: [String.Element] = Array(asciiValue)
    var hex: String = ""
    for char: String.Element in chars {
        hex += String(char.asciiValue!, radix: 16)
    }
    return hex
}

petergi

// 17% faster than using filter on set

function difference(a, b) {
    const s = new Set(b)
    const result = []
    for (const x of a) {
        if (!s.has(x)) {
            result.push(x)
        }
    }

petergi

/**
 * Checks if a string is a Pangram.
 *
 * @param {string} string - The string to be checked.
 * @return {boolean} Returns true if the string is a pangram, false otherwise.
 */
const isPangram = (string) => {
    const alphabet = "abcdefghijklmnopqrstuvwxyz"
    const lowerCaseString = string.toLowerCase()

petergi

// - Use the `split()` method to convert the string `str` into an array of characters.
// - Use the `sort()` method with a compare function to sort the characters in the array.
// - Use the `join()` method to recombine the sorted characters into a string.

/**
 * Sorts the characters in a string in ascending order.
 *
 * @param {string} str - The string to sort.
 * @return {string} The sorted string.
 */

petergi

/**
 * Check if a given string is a palindrome.
 *
 * @param {string} str - The string to be checked.
 * @return {boolean} Returns true if the string is a palindrome, false otherwise.
 */
function isPalindrome(str) {
    const formattedStr = str.toLowerCase().replace(/[\W_]/g, "");
    const reversedStr = formattedStr.split("").reverse().join("");
    return formattedStr === reversedStr;