josgraha

Hypthesis Based Problem Solving

Business Problem -> Facts ~~ -> Gaps ~~ -> Solution
                               (Hypthesis)

Process: To work solution-oriented from an early stage, hypothesis are needed to "fill the gaps"

josgraha

{-# LANGUAGE DataKinds                  #-}
{-# LANGUAGE DeriveAnyClass             #-}
{-# LANGUAGE DeriveGeneric              #-}
{-# LANGUAGE DerivingStrategies         #-}
{-# LANGUAGE FlexibleContexts           #-}
{-# LANGUAGE GeneralizedNewtypeDeriving #-}
{-# LANGUAGE LambdaCase                 #-}
{-# LANGUAGE MultiParamTypeClasses      #-}
{-# LANGUAGE NoImplicitPrelude          #-}
{-# LANGUAGE OverloadedStrings          #-}

josgraha

{
    "name": "IUXTA Pool",
    "description": "iuxta-casus pool",
    "ticker": "IUXTA",
    "homepage": "https://iuxta-casus.com"
}

josgraha

const _ = require('lodash');
mapToObject = m => _.isMap(m) ? [...m].reduce((o, entry) => ({...o, ...{ [_.head(entry)]: mapToObject(_.head(_.tail(entry))) }}), {}) : m;

josgraha

const I = x => x;
const K = x => y => x;
const A = f => x => f(x);
const T = x => f => f(x);
const W = f => x => f(x)(x);
const C = f => y => x => f(x)(y);
const B = f => g => x => f(g(x));
const S = f => g => x => f(x)(g(x));
const P = f => g => x => y => f(g(x))(g(y));
const Y = f => (g => g(g))(g => f(x => g(g)(x)));

josgraha

Logic:

Already going to assume that you know about prefix sums before you read this. We can all agree that for an array A = [], where N = A.length, that there are N prefix sums.

prefix[0] = A[0], prefix[1] = A[0] + A[1], ... prefix[i] = prefix[0] + ... + prefix[i].

Then to calculate how many subarrays are divisible by K is logically equivalent to saying, how many ways can we pair up all prefix sum pairs (i,j) where i < j such that (prefix[j] - prefix[i]) % K == 0

josgraha

{
   permaBan: [/He/],
   mt: false,
   jp: false,
}
 

josgraha

{
    "workbench.startupEditor": "newUntitledFile",
    "window.zoomLevel": 0,
    "terminal.integrated.fontFamily": "'Dank Mono', 'Droid Sans Mono', 'monospace', monospace, 'Droid Sans Fallback'",
    "gitlens.advanced.messages": {
        "suppressCommitHasNoPreviousCommitWarning": false,
        "suppressCommitNotFoundWarning": false,
        "suppressFileNotUnderSourceControlWarning": false,
        "suppressGitVersionWarning": false,
        "suppressLineUncommittedWarning": false,

josgraha

Curated JavaScript and React Resources

Mostly paid list of resources to learn JavaScript and React. This list is sorted in descending recommended order and is grouped by paid and free. My experience is that paid resources are easier to find at the moment but there are lots of great free resources out there. My favorite paid instructors are Stephen Grider and Kent C. Dodds.

Paid Resources

React related

• Udemy: Full stack Node and React by Stephen Grider
• Udemy: Academind course on React 16
• Frontend Masters: Kent Dodds Advanced React Patterns

josgraha

const lastIndex = list => (
  list && list.length > 0 ? list.length - 1 : 0);

const isNone = val => val === null || typeof val === 'undefined';

const asList = list => (isNone(list) ? [] : list);

const isEmptyList = list => list && list.length <= 0;

const isLastIndex = (lst, index) => (asList(lst).length - 1) === index;