jeanlauliac

#!/usr/bin/env node

// Solve the "Coin Change" problem using a bottom-up dynamic programming
// approach. The time complexity is O(n * coins.length) since we have a nested
// loop. The storage complexity is the same, as we store a matrix.
//
// * `coins` is an array of the coin values, eg. [ 1, 2, 3 ]. We assume it
//   to be non-empty.
// * `n` is the amount, eg. 4 cents.
//

jeanlauliac

{
  "genres": {
    "rock music": {
      "title": "Rock music",
      "url": "//en.wikipedia.org/wiki/Rock music",
      "color": "crimson",
      "stylistic_origins": [
        "rock and roll",
        "electric blues",
        "jazz",

jeanlauliac

jeanlauliac

#!/bin/bash

git log --format=format:"%aD" | gawk '

match($0, /^([[:alnum:]]{3}), [[:digit:]]+ [[:alpha:]]{3} \
[[:digit:]]+ ([[:digit:]]+):[[:digit:]]+:[[:digit:]]+/, mt) {
    days[mt[1]]["count"]++;
    days[mt[1]]["hours"][+mt[2]]++;
    total["count"]++;
    total["hours"][+mt[2]]++;

jeanlauliac

Keybase proof

I hereby claim:

• I am jeanlauliac on github.
• I am jeanlauliac (https://keybase.io/jeanlauliac) on keybase.
• I have a public key whose fingerprint is 78FB 9176 EF4C 2B14 FD86 7F56 ECEE A5F1 DDC2 93BF

To claim this, I am signing this object:

jeanlauliac

#!/usr/bin/env node
'use strict';

var Delimiters = {
    '[': ']'
  , '(': ')'
  , '{': '}'
}

// Javascript doesn't contain Sets, so we just use a map with booleans.