wperron

/**
 * Write a function that takes an array of consecutive, increasing letters as
 * input, and returns any missing letters in the array between the first and
 * last letter.
 *
 * Example:
 * ```
 * > missingLetters(['a','b','c','d','f'])
 * > ['e']
 *

wperron

const rows = [
  "qwertyuiop",
  "asdfghjkl",
  "zxcvbnm",
].reduce(
  (acc, curr, i) => {
    curr.split('').forEach(c => acc[c] = i);
    return acc;
  },
  {},

wperron

#!/usr/bin/env deno run -A
import { readStringDelim } from "https://deno.land/std@0.186.0/io/read_string_delim.ts";
import * as path from "https://deno.land/std@0.186.0/path/mod.ts";

async function extractMetricNames(f) {
  const filename = path.join(Deno.cwd(), f);
  let fileReader = await Deno.open(filename);

  let metrics = new Set();

wperron

/// Given a non-empty array containing only non-negative integers, return the
/// list with trailing and leading zeroes removed.
///
/// Example:
///
/// ```
/// > removeZeroes([0, 0, 0, 3, 1, 4, 1, 5, 9, 0, 0, 0, 0])
/// > [3, 1, 4, 1, 5, 9]
///
/// > removeZeroes([0, 0, 0])

wperron

use std::{collections::BTreeSet, fmt::Display, str::FromStr};

/// Write a function that can do the 4 basic operations (add, subtract, multiply
/// and divide) on two fractions. Return the most simplified form of the result.
/// You can assume a non-zero denominator in the input, and don’t use any
/// built-in implementations in your language of choice, if you can!
///
/// Example:
///
/// ```

wperron

use rand::seq::SliceRandom;

/// If you mix up the order of letters in a word, many people can slitl raed and urenadnstd tehm. Write a function that
/// takes an input sentence, and mixes up the insides of words (anything longer than 3 letters).
///
/// Example:
///
/// ```
/// > scramble(["A quick brown fox jumped over the lazy dog."])
/// > "A qciuk bwron fox jmepud oevr the lzay dog."

wperron

/// Given a list of numbers, return all groups of repeating consecutive numbers.
///
/// Examples:
///
/// ```
/// > repeatedGroups([1, 2, 2, 4, 5])
/// [[2, 2]]
///
/// > repeatedGroups([1, 1, 0, 0, 8, 4, 4, 4, 3, 2, 1, 9, 9])
/// [[1, 1], [0, 0], [4, 4, 4], [9, 9]]

wperron

/// Given a string of parenthesis, return the number of parenthesis you need to add to the string in order for it to be balanced.
///
/// Examples:
///
/// ```bash
/// > numBalanced(`()`)
/// > 0
///
/// > numBalanced(`(()`)
/// > 1

wperron

fn main() {
    println!("{}", capitalize_post_vowels("Hello, World!".to_string()));
}

/// Given a string, make every consonant after a vowel uppercase.
fn capitalize_post_vowels(s: String) -> String {
    let mut prev = false;

    s.chars()
        .into_iter()

wperron

[package]
name = "tokio-lifetime"
version = "0.1.0"
edition = "2021"

# See more keys and their definitions at https://doc.rust-lang.org/cargo/reference/manifest.html

[dependencies]
opentelemetry = { version = "0.18.0", features = ["rt-tokio"] }
opentelemetry-otlp = "0.11.0"