hokevins

// Functional Programming: Closure, Partial Application, and Currying

const add = (...args) => args.reduce((a, e) => a + e, 0);

console.log(add(5, 3)) // 8

/*
Partial application allows us to fix a function’s arguments. This lets us derive new functions, with specific behavior, from other, more general functions.

Partial application: A function returning another function that might return another function, but each returned function can take several parameters.

hokevins

// 2023-03-27

// Given a string in dice notation, return a random integer you can get by rolling those dice.

const rollDice = input => {
  const getRandomInt = max => {
    return Math.floor(Math.random() * max) + 1;
  };
  let sum = 0;
  let rolls = input.split('+');

hokevins

A lot of these are outright stolen from Edward O'Campo-Gooding's list of questions. I really like his list.

I'm having some trouble paring this down to a manageable list of questions -- I realistically want to know all of these things before starting to work at a company, but it's a lot to ask all at once. My current game plan is to pick 6 before an interview and ask those.

I'd love comments and suggestions about any of these.

I've found questions like "do you have smart people? Can I learn a lot at your company?" to be basically totally useless -- everybody will say "yeah, definitely!" and it's hard to learn anything from them. So I'm trying to make all of these questions pretty concrete -- if a team doesn't have an issue tracker, they don't have an issue tracker.

I'm also mostly not asking about principles, but the way things are -- not "do you think code review is important?", but "Does all code get reviewed?".

hokevins

REACTO - Spiral

Slides

repl.it

Alternate repl.it

Problem Create a function that takes a multi-dimensional array of integer as input.

hokevins

REACTO - Palindrome Chain Length Problem

(From Codewars: 5kyu problem.)

Number is a palindrome if it is equal to the number with digits in reversed order. For example, 5, 44, 171, 4884 are palindromes and 43, 194, 4773 are not palindromes.

Write a method palindrome_chain_length which takes a positive number and returns the number of special steps needed to obtain a palindrome. The special step is: "reverse the digits, and add to the original number". If the resulting number is not a palindrome, repeat the procedure with the sum until the resulting number is a palindrome.

If the input number is already a palindrome, the number of steps is 0.