Monday, 25 October 2021

Javascript cheat sheet

Promise

The Promise object represents the eventual completion (or failure) of an asynchronous operation and its resulting value.

Therefore we can let an asynchronous method to return as a synchronous method. We can associate handlers to the promise. These handlers will handle eventaul success values or failure reason.

A promise has three states: pending, fulfilled with a value or rejected with a reason. We use then method of promise object to attach handler.

Consuming promise

promiseObj.then(successCallBackFunc, failureCallbackFunc)

Guarantees for then()

  1. then will never be invoked if promise is in pending state
  2. then will be called even if it is added after promise has exited from pending state
  3. can add multiple then. These thens will be called in the order they are added

promise.catch()

return a promise and deals with rejected case only. It is the same as to call then(undefined, onRejected)

promise.finally()

  • the finally() method is executed when the promise is settled no matter it is successful or failed
  • This handler of finally receives no parameters
  • It will return another promise

Creating Promise

Promise.resolve(value) will return

  1. A promise that is resolved by value passed as argument
  2. If value passed as argument is a promise, will return that promise

Promise.reject(reason) will return A promise object that is rejected with a given reason

Promise.all() The argument of all is an array of promise. It will return one promise. This returned promise fulfills when all of the input's promises fulfill (including when an empty iterable is passed), with an array of the fulfillment values. It rejects when any of the input's promises rejects, with this first rejection reason.

The Promise.race() static method takes an iterable of promises as input and returns a single Promise. This returned promise settles with the eventual state of the first promise

setTimeout(functionRef, delay, param1)  delay unit is millisecond
const promise1 = new Promise((resolve, reject) => {
  setTimeout(resolve, 500, 'tuttle');
});

const promise2 = new Promise((resolve, reject) => {
  setTimeout(resolve, 100, 'rabit');
});

Promise.race([promise1, promise2]).then((value) => {
  console.log(value);
  // Both resolve, but promise2 is faster
});
// Expected output: "rabit"
//Promise in action
//Promise constructor accepts two predefined 
//functions: resolve and reject
let p = new Promise((resolve, reject)=> {
        let good = false
        if (good) {
                resolve(100)
        } else {
                reject("sad. bad")
        }
});

//we will see sad. bad. However, if we set good to be true,
//will see 101. Here then accepts two functions. The first is
//for fulfillment and the second is for rejection
p.then((n)=> console.log(n+1), (msg)=>console.log(msg))

//here is another way
p.then((n)=> {
    console.log("resolved")
    console.log("n", n+1)
}).catch((msg) => {
    console.log("rejected")
    console.log("msg", msg)
})

//another example
let p = new Promise((resolve, reject) => {
    let n = Math.floor(Math.random() * 100);
    let good = n % 2 == 0 ? true : false;

    if (good) {
        setTimeout(resolve, 100, { "dd": 1212 });
    } else {
        setTimeout(reject, 200, "bad2");
    }
});

p.then((v) => console.log("suc", v))
    .catch((v) => console.log("failed:", v));

Put axios in a Promise chain

//sample codes to put axios in a Promise chain
session.onpaymentauthorized =  (event)=> {
    applePayInstance.tokenize({
        token: event.payment.token
    }).then( (payload) => {
        const requestData = {
            url: '/test/do-whatever/',
            method: 'post',
            headers: {'content-type': 'application/x-www-form-urlencoded'},
            data: "amount=111"
        }
         
         //return another promise and it will be put in this chain
         return axios(requestData)
    }).then(response => {
            if (response.data.success){
                console.log("good. will complete sesson to dismiss sheet")
            } else {
               console.log("creating order failed")
            }
    }).catch((tokenizeErr) => {
        console.log('Error tokenizing Apple Pay:', tokenizeErr);
        session.completePayment(ApplePaySession.STATUS_FAILURE);
    });
};
//an example to use axios
//an example to use axios
import axios from "axios";
let postData = {
    name: "john",
    age: 35,
};

const requestData = {
    url: '/myulr/test/?eventName=' + eventName,
    method: 'post',
    headers: {
        'content-type': 'application/json',
        'x-requested-with': 'XMLHttpRequest'
    },
    data: postData
}

axios(requestData)
//server side to invoke by node.js
const axios = require('axios');

//to debug
axios(requestData).catch((err) => {
    console.log(err.response)
})

Use async function to handle promise

An async function is a function declared with the async keyword. It works with await keywords to handle promise in a cleaner style. Await and async will not block javascript main thread. await will wait a result of a promise. Here is an example:

myPromiseGenerator = function() {
  return new Promise(resolve => {
    setTimeout(() => {
      resolve('Hello world');
    }, 2000);
  });
}

async function myFunc() {
  console.log('calling');
  
  //waiting for promise result
  const result = await myPromiseGenerator();
  console.log(result);
}

myFunc()

//output will be the following
//calling
//Hello world

Object.assign

const target = { a: 1, b: 2 };
const source = { b: 4, c: 5 };

const returnedTarget = Object.assign(target, source);

console.log(target);
// Expected output: Object { a: 1, b: 4, c: 5 }

console.log(returnedTarget)
// Expected output: Object { a: 1, b: 4, c: 5 }

console.log(source)
// Expected output: Object { a: 1, b: 2} . no change from origin

for ..of loops

ES6 adds a for ..of loop. It is used to loop of set of values produced by an iterator. Most likely, will be used to loop through array and string


var arr = ['a','b','c']
for (var val of arr) {
    console.log(val)
}
//'a', 'b', 'c'


for (var c of 'hi') {
    console.log(c)
}
//'h', 'i'

//loop array index
for (let i in arr) {
    console.log(i)
}
//0,1,2

use object as hash table

The below is a solution for a LeetCode problem


/**
 * @param {number[]} nums
 * @return {number}
 */
var singleNumber = function(nums) {
	//define a object
    let d = {}
    
    for (let n of nums) {
    	//check if n is a property of object. like check if hash has key
        if (n in d) {
            d[n] = 2
        } else {
            d[n] =1
        }
    }
    
    //loop through object's property
    for (let n in d) {
        if (d[n]==1) {
            return n;
        }
    }
    
    //if want to get all properties of this object
    let keys = Object.keys(d)
    
    // get length
    Object.keys(obj).length
};

Build array of objects

//build offer array
let offerVals = []
for (let offer of data.offers) {
    let obj = {}
    obj[offer.sku] = offer.quantity
    offerVals.push(obj)
}
//build json string with array. noted that build obj in two ways
//output {"category":"developers","persons":[{"name":"leo","age":50},
//{"name":"john","age":40}]}
let obj = [];
obj.push({ name: "leo", age: 50 });

let p2 = {};
p2["name"] = "john";
p2["age"] = 50;
obj.push(p2);

let str = { category: "developers", persons: obj };
console.log(JSON.stringify(str));

ES6 template literals

Use backtick ` as delimiter.

let name="leo"
let welcome = `hi ${name}!`;

console.log(welcome) //hi leo!

//allow split across multiple lines
let name=`hello
world`;

//hello
//world
console.log(name)

Array

//sort number array
nums.sort((a,b)=>a-b)

//initiate array with single values
// arr = Array(arraySize).fill(value)
let ans = Array(5).fill(-1)

//copy array
const animals = ['dog', 'bison', 'camel', 'duck', 'elephant'];

let animalCopy = animals.slice();

//also can do the following to copy
let animalCopy = [].concat(animals)


//array merge
const array1 = ['a', 'b', 'c'];
const array2 = ['d', 'e', 'f'];
const arr3 = ['j','p']
const array4 = array1.concat(array2, arr3);
//array4 is ['a', 'b', 'c','d', 'e', 'f','j','p']

//unshift to add element in the begining of array
const array1 = [1, 2, 3];
array1.unshift(4, 5);
console.log(array1);
// expected output: Array [4, 5, 1, 2, 3]

//map() will create a new array by calling a provided function for every elements
const arr1 = [1, 2, 3]
const arr2 = arr1.map((n)=>n*n)
console.log(arr2) //[1,4,9]

//use filter to move element to the begin of array. Here assume p is in array and it is unique
 arr = arr.filter(item => item !== q);
 arr.unshift(q);
 
 //create a 26 letters array
 const letters = 'abcdefghijklmnopqrstuvwxyz'.split('');
 
 //string to array
 let s ="leetcode"
 const chars = [...s];

Object destructuring

const pet = {name:"weiwei", age:13}

//here is object destructuring
 const {name, age} = pet
 
 console.log("name", name)
 console.log("age", age)
 
 //Destruct and Rename
const person =  {
    name: "leo",
    country: "Canada"
}

const {name:first} = person
console.log("first is:", first) //leo
console.log("name:", name) //undefined

Math


// integer division. will get 4
Math.trunc(32/7)

High order component

A good blog about high order component

Four steps

  1. Create a base component
  2. Create a function which take base component and return a upgraded component
  3. import that function and call it to get a new component
  4. use this new component. This new component normally has new extra props

Redux form is high order component. Here is a good introduction for redux form.

Response.json()

The json() method takes a Response stream and reads it to completion. It returns a promise which resolves with the result of parsing the body text as JSON. Then we can use this data to do some thing. The pattern is showing below which work with fetch.

const remoteEndPoint = "https://someapi";
fetch(remoteEndPoint)
      .then((response) => response.json())
      .then((data) => {
        this.setState({ loading: false, data: data });
      })
      .catch(console.error);

Use Axios

We can send a header config when do API call using Axios. Noted position of config field for get and post are different.

const config = {
    headers: {
        "X-Authorization-JWT": initData.jwt,
        "Content-Type": "application/json"
    }
}

axios.get(url, config)
axios.post(url, data, config)
axios.put(url, data, config)

//to pass csrf and more headers
const config = {
    headers: {
        'Content-Type': 'application/json',
        'X-CSRF-Token': csrf
    }
}

lodash

_.includes( collection, value)

let a=[1,2]
let f = _.includes(a, 3) //false
f = _.includes(a,1) //true 

Some useful built in function

slice() will do a shallow copy of an array. You can pass indexes as argument of the function. If no argument is passed, do a shallow copy of entire array

const animals = ['ant', 'bison', 'elephant', 'dog'];
console.log(animals.slice());
// expected output: Array ["ant", "bison", "elephant", "dog"]

Object.assign() method copies all enumerable own properties from one or more source objects to a target object. It returns the modified target object.

const target = { a: 1, b: 2 };
const source = { b: 4, c: 5 };
const returnedTarget = Object.assign(target, source, {leo:22});
console.log(target);
console.log(returnedTarget);
//output
> Object { a: 1, b: 4, c: 5, leo: 22 }
> Object { a: 1, b: 4, c: 5, leo: 22 }

two ways to copy an object

var player = {score: 1, name: 'Jeff'};
var newPlayer = Object.assign({}, player, {score: 2});
// Now player is unchanged, but newPlayer is {score: 2, name: 'Jeff'}

// Or if you are using object spread syntax proposal, you can write:
// var newPlayer = {...player, score: 2};

Array reduce(). It accept a callback, and will work on every element in order. After done, return the last value. For that callback function, the first argument is the previous value, and the seconde is the current value. When run on the first element, we can pass an initial value

let arr=[1,2,3]
let iniV = 7
let ans = arr.reduce((total,n)=>total*n, 7)
console.log(ans) //42 = 7*1*2*3

If initial value is not provided, the first element will be used as init value and process element starting from the second element.

let arr=[1,2,3]
let ans = arr.reduce((total,n)=>total*n)
console.log(ans)//6=1*2*3

mapping letter to integer. 'A' =>1 A has value 65

columnTitle.charCodeAt(i)-64

cast type

let a="8"
let b = +a
console.log(typeof a) //string
console.log(typeof b) //number

Optional chaining (?.)

In most use case, try to access an property of object. If it does not exist, return undefined instead of giving out error.

const obj = {
  cat: {
    name: 'Dinah'
  }
};

console.log(obj.cat2?.name);
// expected output: undefined

console.log(obj.cat2.name);
//expected error

console.log(obj.cat.name);
//Dinah

Use [key] notation for object

It is also called computed name.

const name = "leo"
const obj = {[name]:"developer"}

console.log(obj.leo)
console.log(obj[name])

//undefined
console.log(obj.name)

computed name in class

let methodName="say";
class Person {
	constructor(name) {
    	this.name=name;
    }
    
    [methodName] () {
    	console.log(this.name);
    }
}

char, int, ascii code

//solution for Leetcode 2194
var cellsInRange = function(s) {
    let c1 = s.charCodeAt(0)
    let c2 = s.charCodeAt(3)
    
    //0 ascii code is 48
    let r1 = s.charCodeAt(1) - 48
    let r2 = s.charCodeAt(4) -48
    
    let ans = []
    
    for (let c=c1; c<=c2; c++) {
        for (let r=r1; r<=r2; r++) {
        	//ascii code to char
            let cell = String.fromCharCode(c) + r
            ans.push(cell)
        }
    }
      
    return ans
    
};

Logic or

//The Logical OR operator (||) returns the value of its 
//second operand, if the first one is falsy, otherwise the value
//of the first operand is returned
let a ="foo" || "bar"; // returns "foo"
console.log(a)

a = false || "bar"; // returns "bar"
console.log(a)

window.dataLayer = window.dataLayer || [];

Class

Solution for Leetcode 2622

var TimeLimitedCache = function () {
  this.d = {};
};

/**
 * @param {number} key
 * @param {number} value
 * @param {number} time until expiration in ms
 * @return {boolean} if un-expired key already existed
 */
TimeLimitedCache.prototype.set = function (key, value, duration) {
  let ans = false;
  if (key in this.d) {
    let obj = this.d[key];
    if (obj.expiry >= Date.now()) ans = true;
  }
  this.d[key] = { v: value, expiry: duration + Date.now() };

  return ans;
};

/**
 * @param {number} key
 * @return {number} value associated with key
 */
TimeLimitedCache.prototype.get = function (key) {
  if (key in this.d) {
    let obj = this.d[key];
    return (obj.expiry >= Date.now()) ? obj.v : -1
  }

  return -1;
};

/**
 * @return {number} count of non-expired keys
 */
TimeLimitedCache.prototype.count = function () {
  let ans = 0;
  let keys = Object.keys(this.d);
  for (let k of keys) {
    if (this.d[k].expiry >= Date.now()) ans = ans + 1;
  }
  return ans;
};

/**
 * Your TimeLimitedCache object will be instantiated and called as such:
 * var obj = new TimeLimitedCache()
 * obj.set(1, 42, 1000); // false
 * obj.get(1) // 42
 * obj.count() // 1
 */

Solution for Leetcode 2695

/**
 * @param {number[]} nums
 */
var ArrayWrapper = function(nums) {
    this.nums = nums
};

ArrayWrapper.prototype.valueOf = function() {
    return this.nums.reduce((a, b) => a + b, 0)
}

ArrayWrapper.prototype.toString = function() {
    return `[${this.nums.join()}]`
}

/**
 * const obj1 = new ArrayWrapper([1,2]);
 * const obj2 = new ArrayWrapper([3,4]);
 * obj1 + obj2; // 10
 * String(obj1); // "[1,2]"
 * String(obj2); // "[3,4]"
 */

Some mistakes

The below is solution for Leetcode 2627

Scope problem. use pendingF = [] instead of let pendingF = []. Without let, pendingF becomes a global variable. Because Leetcode will run bunches of test, pendingF is accessed by all tests and it causes a hard fix bug.

/**
 * @param {Function} fn
 * @param {number} t milliseconds
 * @return {Function}
 */
var debounce = function (fn, t) {
  //make sure this variable is not global. Need let
  let pendingF = [];
  return function (...args) {
    let cur = Date.now();
    for (let obj of pendingF) {
      if (obj.start > cur) {
        clearTimeout(obj.timeout);
      }
    }

    myTimeout = setTimeout(() => fn(...args), t);
    pendingF.push({ timeout: myTimeout, start: cur + t });
  };
};

/**
 * const log = debounce(console.log, 100);
 * log('Hello'); // cancelled
 * log('Hello'); // cancelled
 * log('Hello'); // Logged at t=100ms
 */

Sort Array

Sort Array

Play with object

/**
 * @param {Object} obj
 * @return {Object}
 * Leetcode 2822
 */
var invertObject = function (obj) {
  let ans = {};
  for (let k of Object.keys(obj)) {
    let v = obj[k];

    if (Object.hasOwn(ans, v)) {
      let cur = ans[v];

      if (Array.isArray(cur)) {
        cur.push(k);
      } else {
        cur = [cur];
        cur.push(k);
      }

      ans[v] = cur;
    } else {
      ans[v] = k;
    }
  }

  return ans;
};

Set

let set = new Set();
set.add(1);
set.add(1);
set.add(2);
set.add(100);

//size is 3
console.log(set.size);

Debug

Safari

  • right click page. select inspect element to show console
  • click recycle bin in the upper right corner to clear console

Chrome

  • right click page. select inspect to show console
  • type console.clear() to clear console

package.json

//do not install devDependencies
npm install --production

//will install devDependencies
npm install

jQuery

//ajax call to get data
$.get("http://test.com", function(data, status){
    alert("Data: " + data + "\nStatus: " + status);
});
//find first element of a class
$(".myClass").first();
//pass a string containing HTML and create a new element:
let html = "
Hi
"; let myEle = $(html);

let parent = $(".myClass").first();
let html = "<div>Hi</div>";
let myEle = $(html);

parent.append(myEle);

Switch node version by nvm

nvm list

# add the following in .bashrc, so alway use the version 16 when open a terminal
nvm use 16.15.1

not null and not undefined

//the followinig two lines are equasl
a != null;
a !==null && a !== undefined;














Sunday, 24 October 2021

Solve a LeetCode problem with regular expression

Here is the problem LeetCode 2047

Eventually, I figure out a regular express to solve this problem. I will explain how this regular expression works


//Java
import java.util.regex.*;
class Solution {
    public int countValidWords(String sentence) {
        String[] words = sentence.trim().split("\\s+");
        int ans = 0;
        
        Pattern pattern = Pattern.compile("^(([a-z]{0,})|([a-z]+\\-[a-z]+))[!\\.,]?$");
        
        for(String word: words) {
           Matcher matcher = pattern.matcher(word);
            if (matcher.find()) {
                ans++;
            }
        }
        
        return ans;
    }
}

#Python
import re
class Solution:
    def countValidWords(self, sentence: str) -> int:
        arr = sentence.split()
        ans = 0
        for word in arr:
            if re.search("^(([a-z]{0,})|([a-z]+\-[a-z]+))[!\.,]?$", word):
                ans+=1
        return ans

# ruby
# @param {String} sentence
# @return {Integer}
def count_valid_words(sentence)
    words = sentence.split
    ans = 0
    for word in words
        if word.match(/^(([a-z]{0,})|([a-z]+\-[a-z]+))[!\.,]?$/)
            ans = ans +1
        end
    end
    return ans
end

//PHP
class Solution {
    /**
     * @param String $sentence
     * @return Integer
     */
    function countValidWords($sentence) {
        $words = preg_split("/\s+/", trim($sentence));
        $ans = 0;
      
        foreach ($words as $word) {
           if (preg_match("/^(([a-z]{0,})|([a-z]+\-[a-z]+))[!\.,]?$/", $word)) {
                $ans++;
            }
        }
        return $ans;
    }
}

/**
 * Javascript
 * @param {string} sentence
 * @return {number}
 */
var countValidWords = function(sentence) {
    let arr = sentence.trim().split(/\s+/)
    let ans = 0
    arr.forEach((word)=>{
                if (word.match(/^(([a-z]{0,})|([a-z]+\-[a-z]+))[!\.,]?$/)) {
                    
                    ans++
                }
    })
    return ans
    
};

Here is a summary for regular express

How that regulare expression works

  • [!\.,]?$
    one or zero punctuation in the end of word
  • ^(([a-z]{0,})|([a-z]+\-[a-z]+))
    all lower case letters or lower case letters . "-" lower case letters

continue to analyse

^(([a-z]{0,})|([a-z]+\-[a-z]+))
. There are two parts in it

  • ([a-z]{0,})
    string consist of zero or more lower case letters
  • ([a-z]+\-[a-z]+)
    string with hypen which is wrapped with lower case letters

regular expression used here

  • how many time to repreat. ? (0 or once) + (at least once) {0,} (one and more)
  • group (x|y) (x or y). The first part of the expression uses group
  • boundary ^(start) $(end)

If you try to solve it without using regular expression, it will be very tedious.


//PHP
class Solution {

    /**
     * @param String $sentence
     * @return Integer
     */
    function countValidWords($sentence) {
        $words = explode(" ", $sentence);
        $ans = 0;
    
        foreach ($words as $word) {
            $word = trim($word);
            if ($word=="") {
                continue;
            }

            if (self::isValid($word)) {

                $ans++;
            }
        }
        return $ans;
    }
    
    public static function isValid($word) {
        //generate lower case letter array
        $letters = [];
        foreach (range('a', 'z') as $l) {
            $letters[] = $l;
        }
        
        $p = ['!', '.', ','];
            
        $allowedC = array_merge($letters, $p, ['-']);
      
        //count hyphens and index
        $hyC = 0;
        $hi = 0;
        
        //count punctuation and index
        $pc = 0;
        $pi = 0;
        
        for ($i=0; $i1 || $hyC >1) {
            return false;
        }
        
        if ($pc == 1 && $pi != strlen($word)-1) {
            return false;
        }
        
        if ($hyC == 0) {
            return true;
        }
        
        if ($hi-1<0 || $hi+1>= strlen($word)) {
          
            return false;
        }
        
      
        if ((!in_array($word[$hi-1], $letters)) || (!in_array($word[$hi+1], $letters))) {
           
            return false;
        }
        
        return true;
    }
}

Sunday, 17 October 2021

Solve LeetCode design problem with different languages

Here is a LeetCode problem. Now will solve this design problem in different language.

  1. Java
  2. Python
  3. Ruby
  4. PHP
  5. JavaScript ES6
  6. JavaScript

Java


class Bank {

    private long[] balance;
    private int n;
    public Bank(long[] balance) {
        this.balance = balance;
        this.n = balance.length;
        
    }
    
    private boolean goodA(int account) {
        return account >=1 && account<= this.n;
    }
    
    public boolean transfer(int account1, int account2, long money) {
        if (!goodA(account1) || !goodA(account2)) {
            return false;
        }
        
        if (this.balance[account1-1] < money) {
            return false;
        }
        
        this.balance[account1-1] = this.balance[account1-1] - money;
        this.balance[account2-1] = this.balance[account2-1] + money;
        return true;
        
        
    }
    
    public boolean deposit(int account, long money) {
        if (!goodA(account)) {
            return false;
        }
        
        this.balance[account-1] = this.balance[account-1] + money;
        return true;
        
    }
    
    public boolean withdraw(int account, long money) {
        if (!goodA(account)) {
            return false;
        }
        
        if (this.balance[account-1] < money) {
            return false;
        }
        
        this.balance[account-1] = this.balance[account-1] - money;
        return true;
        
    }
}

Python


class Bank:

    def __init__(self, balance: List[int]):
        self.balance = balance
        self.n = len(balance)
    
    def goodA(self, account):
        return account>=1 and account<=self.n
        

    def transfer(self, account1: int, account2: int, money: int) -> bool:
        if not self.goodA(account1) or not self.goodA(account2):
            return False
        if self.balance[account1-1] < money:
            return False
        
        self.balance[account1-1] = self.balance[account1-1] - money
        self.balance[account2-1] = self.balance[account2-1] + money
        return True
        

    def deposit(self, account: int, money: int) -> bool:
        if not self.goodA(account):
            return False
        
        self.balance[account-1] = self.balance[account-1] + money
        return True
        

    def withdraw(self, account: int, money: int) -> bool:
        if not self.goodA(account):
            return False
        
        if self.balance[account-1] < money:
            return False
        
        self.balance[account-1] = self.balance[account-1] - money
        
        return True

Ruby


class Bank

=begin
    :type balance: Integer[]
=end
    def initialize(balance)
        @balance = balance
        @n = balance.length
        
    end


=begin
    :type account1: Integer
    :type account2: Integer
    :type money: Integer
    :rtype: Boolean
=end
    def transfer(account1, account2, money)
        if account1<1 || account1>@n
            return false
        end
        
        if account2<1 || account2>@n
            return false
        end
        
        if @balance[account1-1] < money
            return false
        end
        
        @balance[account1-1] = @balance[account1-1] - money
        @balance[account2-1] = @balance[account2-1] + money
        return true
 
    end
=begin
    :type account: Integer
    :type money: Integer
    :rtype: Boolean
=end
    def deposit(account, money)
        if account<1 || account>@n
            return false
        end
        
        @balance[account-1] = @balance[account-1] + money
        return true
 
    end


=begin
    :type account: Integer
    :type money: Integer
    :rtype: Boolean
=end
    def withdraw(account, money)
        if account<1 || account>@n
            return false
        end
        
        if @balance[account-1] < money
            return false
        end
        
        @balance[account-1] = @balance[account-1] - money
        return true
        
    end

end

PHP


class Bank {
    private $balance;
    private $n;
    /**
     * @param Integer[] $balance
     */
    function __construct($balance) {
        $this->balance = $balance;
        $this->n = count($balance);
        
    }
  
    /**
     * @param Integer $account1
     * @param Integer $account2
     * @param Integer $money
     * @return Boolean
     */
    function transfer($account1, $account2, $money) {
        if ($account1 > $this->n || $account1 <1) {
            return false;
        }
        
        if ($account2 > $this->n || $account2 <1) {
            return false;
        }
        
        if ($this->balance[$account1 -1] < $money) {
            return false;
        }
        
        //do transfer
        $this->balance[$account1 -1] = $this->balance[$account1 -1] - $money;
        $this->balance[$account2 -1] = $this->balance[$account2 -1] + $money;
        
        return true;
        
    }
    
     /**
     * @param Integer $account
     * @param Integer $money
     * @return Boolean
     */
    function deposit($account, $money) {
         if ($account > $this->n || $account <1) {
            return false;
        }
        
        $this->balance[$account -1] = $this->balance[$account -1] + $money;
        return true;
        
    }
  
    /**
     * @param Integer $account
     * @param Integer $money
     * @return Boolean
     */
    function withdraw($account, $money) {
         if ($account > $this->n || $account <1) {
            return false;
        }
        
         if ($this->balance[$account -1] < $money) {
            return false;
        }
        
        $this->balance[$account -1] = $this->balance[$account -1] - $money;
        return true;
    }
}

Javascript ES6


class Bank {
    constructor(balance) {
        this.balance = balance
    }
    
    notValid(account) {
        return account<1 || account > this.balance.length
    }
    
    transfer(account1,account2,money) {
        if (this.notValid(account1) || this.notValid(account2)) {
            return false
        }
        
        if (money > this.balance[account1-1]) {
            return false;
        }
        
        this.balance[account1-1] = this.balance[account1-1] - money
        this.balance[account2-1] = this.balance[account2-1] + money
        return true
    }
    
    deposit(account,money) {
        if (this.notValid(account)) {
            return false;
        }
        this.balance[account-1] = this.balance[account-1] + money
        return true
    }
    
    withdraw(account,money) {
        if (this.notValid(account)) {
            return false;
        }
         
        if (money > this.balance[account-1]) {
            return false;
        }
         
        this.balance[account-1] = this.balance[account-1] - money
        return true
    }
    
}

JavaScript


/**
 * @param {number[]} balance
 */
var Bank = function(balance) {
    this.balance = balance
    
};

Bank.prototype.check = function(account) {
    return account>=1 && account<= this.balance.length
    
};

/** 
 * @param {number} account1 
 * @param {number} account2 
 * @param {number} money
 * @return {boolean}
 */
Bank.prototype.transfer = function(account1, account2, money) {
    if (!this.check(account1) || !this.check(account2)) {
        return false;
    }
    
    if (this.balance[account1-1] < money) {
        return false;
    }
    
    this.balance[account1-1] = this.balance[account1-1] - money;
    
    this.balance[account2-1] = this.balance[account2-1] + money;
    return true;
    
};

/** 
 * @param {number} account 
 * @param {number} money
 * @return {boolean}
 */
Bank.prototype.deposit = function(account, money) {
    if (!this.check(account)) {
        return false
    }
    
    this.balance[account-1] = this.balance[account-1] + money;
    return true;
    
};

/** 
 * @param {number} account 
 * @param {number} money
 * @return {boolean}
 */
Bank.prototype.withdraw = function(account, money) {
    if (!this.check(account)) {
        return false
    }
    
    if (this.balance[account-1] < money) {
        return false;
    }
    
    this.balance[account-1] = this.balance[account-1] - money;
    
    return true;
    
};

Saturday, 16 October 2021

Javascript Array Sort. Surprise!

What is the output for the below


arr = [3,20,17,2,12,15,17,4,15,20]
arr.sort()
console.log(arr)

The out put is:

[12, 15, 15, 17, 17, 2, 20, 20,  3,  4] 

The reason is that for this built in sort function, it will converting the elements into strings before do sorting! This is the only language I find so far to do such a stupid thing

To sort integer in the expected order, do that


//will out put [2,  3,  4, 12, 15, 15, 17, 17, 20, 20]
arr = [3,20,17,2,12,15,17,4,15,20]
arr.sort((a,b) => a-b)
console.log(arr)

Friday, 15 October 2021

Git cheat sheet

See branch

# see remote branch
git branch -r

# find remote branches which has release in name and sorted time desc
git branch -r --sort=-committerdate |grep release

Git rebase

# rebase 5 commit into one
git rebase -i HEAD~5

Patch file

git diff develop feature_br > test.diff
patch -p1 < test.diff

Show details of git server

git remote show origin

Show files changes in commits

git show --name-status

Push branch to remote origin and create a PR

git push -u origin feature/my-ticket
//the same as
git push --set-upstream origin feature/my-ticket

Create tag

//list tag by date
git log --tags --simplify-by-decoration --pretty="format:%ai %d"

//show annotated tags with their message
git tag -n

//list tag by pattern
git tag -l "release-cron*"

//show tag details including tag message
git show release-cron-v2021v05.1

//create tag 2.0.1 in local
git tag -a 2.0.1 -m "create tag message"

//push tag
git push origin 2.0.1


//checkout tag
 git checkout tags/2.0.1 -b mytag_branch

Remote origin

// find remote origin
git config --get remote.origin.url

// set remote origin. In bitbucket, may need username in url such as 
git remote set-url origin [you repo URL>

git remote set-url origin https://lshen@git.testcompany.dev/scm/smp/looksearch.git

The below is a test to switch between ssh and https repo url. This repo has two url

ssh:  git@github.com:revenuewire/translation.git
https: https://github.com/revenuewire/translation.git
git clone  https://github.com/revenuewire/translation.git
//try find url. output: https://github.com/revenuewire/translation.git
git config --get remote.origin.url

//update url
git remote set-url origin  git@github.com:revenuewire/translation.git

//try find url again. output: git@github.com:revenuewire/translation.git
git config --get remote.origin.url

//see all config including origin
git config --list

Other commands

// see if in git repository. If in repository, get true.
//if not in, get "fatal: not a git repository (or any of the parent directories): .git"
git rev-parse --is-inside-work-tree
//create a code review in bitbucket
git push --set-upstream origin branch_name

You are in 'detached HEAD' state

Good explanation

Will get the detached HEAD state by checking out a commit directly

git checkout acb8a20
git status
HEAD detached at acb8a20
nothing to commit, working tree clean

To go back normal. Assume you are at master branch before

git checkout master

Want to stay here, make changes and keep changes

git branch new_branch_name
git checkout new_branch_name

If HEAD is synonymous with the last commit in the current branch, HEAD is attached to a branch.

Create a pull request in GitHub

//push the feature branch
 git push -u origin feature/JFR-3864
 
//Then shoud see something as
//remote: Create a pull request for 'feature/JFR-3864' on GitHub by visiting:
//remote: https://github.com/myconabsbsbsbs/bar/pull/new/feature/JFR-3864

Use the link to create a pull request. 
You can specify a reviewer when create pull request

Move repository from Bitbucket to GitHub

mkdir my_temp

cd my_temp

git clone --mirror https://git.mybitbucket.dev/scm/pay/my-api.git

cd my-api.git/

git remote set-url --push origin git@github.com:my/my-api.git

git push --mirror

Remove bigfile from Git repository

BFG Repo-Cleaner

git clone --mirror https://git.mybitbucket.dev/scm/pay/my-api.git

java -jar bfg.jar --strip-blobs-bigger-than 100M my-api.git

cd my-api.git

git reflog expire --expire=now --all && git gc --prune=now --aggressive

Show when a branch is created

git checkout your_branch_name
git show --summary

Create a PR for develop to master in github console

  1. go to github repository
  2. click pull request
  3. click new pull request button
  4. choose base: master, compare:develop
  5. create "Create pull request"
  6. title Rcv1.2.0

Create a release branch which source from master on github console

  1. go to github repository
  2. go to branch selector and click View all brances
  3. create New Branch button
  4. give Branch name: release/v1.3.0 and Branch source: master

Ruby cheat sheet

Range

Ruby range includes the last index.

str = "helloworld"
#print "hel"
puts str[0..2]

#print 0, 1, 2
(0..2).each do |i|
    puts i
end

# range with step (here get 0, 3, 6)
(0..8).step(3) do |i|
    puts i
end

String


1. find index of char in a string
i = email.index('@')

2. substring
# the first 3 chars
e1 = email[0..2]

# get the last char in string
lastC = email[-1]

# get single char by index. The following will return "b"
s = "ab"
puts s[1]

3. string length
l = email.length

4. split string by space to array
w = "hello world"

# split will remove leadin and trailing spaces. Also it will split by multiple spaces
#return ["hello", "world"]
arr = w.split

5. string to int; int to string
"5".to_i
5.to_s

6. concatenation 
# print "ab"
puts "a" + "b"

7. loop through
"abc".each_char do |c|
puts c
end

8. convert number to different base
255.to_s(36) #=> "73"
255.to_s(16) #=> "ff"
255.to_s(2)  #=> "11111111"

9. array of 26 letters
arr = "abcdefghijklmnopqrstuvwxyz".chars()
# find char from begin or from end. return 0 and 3 respectively
"abca".index('a')
"abca".rindex("a")

10. use range
arr = ('a'..'z').to_a
arr.index('b')

11. string to array
column_title = "ABC"
arr = column_title.chars

12. char to Ascii value. get 97
"a".ord

13. get assii values for chars in string (97, 98)
"ab".each_byte do |c|
    puts c
end

Array

# pre define array with 10 elements of empty string
arr = Array.new(10, "")

# join array into string
# will return "Hello world"
str = ["Hello", "world"].join(" ")

# shift will remove the first element
arr.shift

#unshift will add element in the begin
arr.unshift("hi")

# reverse array
arr = arr.reverse()

# sort array in house
arr = [4,2,6,1,9]
arr.sort!

# to access last element of arr
arr[-1]

# sort array without change original array
arr2 = arr.sort()

# drop. drop the first n element and return result
arr = [1,2,3,4,5]

# result will be [3,4,5]
result = arr.drop(2)

# check if array has value
n=3
if (arr.include?n)

# delete element by value
n =3
nums2.delete_at(nums2.find_index(n))

#loop through array using each_with_index
nums = [1,2,3,4]
nums.each_with_index do |val, index|
    puts val
    puts index
end

#loop through array using each
nums.each {|val| puts val }

nums.each do |val|
    puts val
end

#loop through array using for .. in
for val in nums
    puts val
end

for i in (0..nums.length-1)
    puts nums[i]
end

# loop through array reverse with index
(0..n-1).reverse_each do |i|
...
end

# access last element
arr[-1]

# add last and remove from last
arr = []
arr.apend(1)
arr.pop()

#find index. return 1
arr = "abcdefghijklmnopqrstuvwxyz".chars()
    puts arr.index('b')

# conconcat array to string
arr.join("")

#remove the first element. e is 1 and arr becomes [2, 3, 4]
arr = [1,2, 3,4]
e = arr.shift

Hash


#create hash
hash1 = {}

#initiate hash with default data. Not set default value to be array
# Otherwise, they are pointing to the same array
hash2 = Hash.new(1)

#assigin value
hash1['a'] = 10

# access hash
count = hash1['a']

# get default value. should print out 1 because we set default to be 1
puts hash2['b']

# check if key exist in hash. should get false
puts hash2.key?('b')

# loop through hash
hash1.each do |key, val|
        puts key
        puts val
end

# get hash length
puts hash.length()

# empty a hash
hash.clear()

Set


# create a new set
s = Set.new()

# add element to set. also can do: s.add(1)
s<<1

# get length
s.length

Queue

queue = Queue.new
# add element
queue.push(node)
# remove element
node = queue.pop
# size
size = queue.length

Math

# return 9
(17.to_f/2).round

#return 8
17/2

# find min or max
[a, b].max
[a, b].min

# do math pow
26**3

# convert number to any base. Return string
s = n.to_s(b)

Class

Can add an method to a object directly

obj = Object.new

def obj.event
  "small event"
end

puts obj.event

Can overriding method in the same class

class Ticket
  def event
    "can not really specify yet..."
  end
  def event
    "wht define me again"
  end
end

ticket = Ticket.new
puts ticket.event

Reopen a class to add more methods

class Ticket
  def event
    "can not really specify yet..."
  end
end

class Ticket
  def price
    puts "100 yuan"
  end
end

ticket = Ticket.new
puts ticket.event
ticket.price

equal sign(=) method name

class Ticket
  def price=(price)
    @price = price
  end
 
  def price
    @price
  end
end

ticket = Ticket.new
ticket.price=(10)
puts ticket.price

Modules


#load a file that is relative to the file containing the require_relative statement.
require_relative "stacklike"
class Stack
	# module name
	include Stacklike
end

More..

#skip a loop. ruby version continue
next if ansM.key?(re)

Thursday, 14 October 2021

Docker

run docker image

docker image ls
REPOSITORY      TAG            IMAGE ID       CREATED          SIZE
java            8-jdk-alpine   3fd9dd82815c   4 years ago      145MB

//start a container using image
docker run -i -t 3fd9dd82815c /bin/sh

//find if www-data group exists in alpine:3.14
docker run --rm -it alpine:3.14 cat /etc/group | grep www-data

//find php version of this linux box
docker run --rm -it docker-php7-alpine:1.3.3 php -v

//link another container
docker run --link docker_mysql_1:sql-master.local.buzz.io

//add entry in host file of docker container
docker run --add-host sql-master.sandbox.buzz.io:250.48.4.218


about -p (or --publish) flag

docker run -p [host port]:[container port]

The -p flag in docker run is used to publish a container's port(s) to the host. It allows external access to the container's network ports. For example, if a container is running a web server on port 80 and you want to access it from your host machine on port 8080, you would use the command docker run -p 8080:80 [image name]. This would map port 80 of the container to port 8080 on the host machine.

delete all stopped container

docker container prune

Start a stopped container

//tweb is container name
docker container start tweb

delete docker image

 docker image rm b9032ca8381a

That number is image id. get by run docker image ls

go into docker container

docker exec -it container_name bash | ash 

-i -t flag: "interactively" type commands to the pseudo-tty/terminal created by the -t switch.

Some times need to replace /bin/sh with /bin/bash depending on which program container has

see volumes

docker volume ls
//see docker volumes a contained mounted
docker inspect -f '{{ .Mounts }}' container_id

//sample output
[{bind  /home/leo2019/jenkins_home /var/jenkins_home   true rprivate}]
//$PWD is a built in env variable. It is current directory
volumes:
    - $PWD:/var/src:delegated

see log

docker logs container_name

build image

//build image called web:latest. do not forget dot
//it tells docker to use current directory as build context
docker image build -t web:latest .

//--no-cache will not use cached layers
docker-compose build  --no-cache web

see image layer

docker image inspect my_image_name

//the above will show image maintanter. Therefore, by changing
//maintanter and inspect image
//we can be sure it is using the new docker file

push image to docker hub

Assume there is a image in local called web:latest. Want to push to leo_image in docker hub

//re-tag
docker image tag web:latest leo_image/web:latest

//docker login
docker login

//push to docker hub
docker image push leo_image/web:latest

Docker copy

It is very useful. One use case is that we can pre-built some binary instead of building it directly when build image. Then copy the binary to the right destination.

COPY extra_php_extension/grpc.so /usr/lib/php7/modules/.
COPY extra_php_extension/protobuf.so /usr/lib/php7/modules/.

//from alpine base image. The following will build grpc.so and protobuf.so and it will
//take 20 minutes. Instead we can build once and grab grpc.so and protobuf.so. Then use
//copy command to do the copy. It will save lots of build time.
RUN apk --update add php-pear php7-dev g++ make linux-headers php-phar

RUN apk add --no-cache --virtual .phpize-deps $PHPIZE_DEPS \
       && pecl install grpc \
       && pecl install protobuf \
       && apk del .phpize-deps

Trouble shooting

build always failed. After change Dockerfile to dockerfile, it works. what?

docker-compose build web get error: [output clipped, log limit 1MiB reached]

To solve:

COMPOSE_DOCKER_CLI_BUILD=0 DOCKER_BUILDKIT=0 docker-compose build web 

COMPOSE_DOCKER_CLI_BUILD

Configure whether to use the Compose python client for building images or the native docker cli. By default, Compose uses the docker CLI to perform builds, which allows you to use BuildKit to perform builds. Set COMPOSE_DOCKER_CLI_BUILD=0 to disable native builds, and to use the built-in python client.

docker network

My Post for Docker Network

Copy File from container in EC2 to local machine

//go to EC2 which host the container
ssh -i NOC.pem ec2-user@10.123.6.123

//copy file from container to EC2
docker cp ecs-sandbox-container-c8bdbc01:/var/src/composer.lock /tmp/.

//copy file to local
scp -i NOC.pem ec2-user@10.123.6.123:/tmp/composer.lock .

docker info

Also can see how much data space we have. If data space is too low, some tasks can not be done.

docker info
Client:
 Context:    desktop-linux
 Debug Mode: false
 Plugins:
  buildx: Docker Buildx (Docker Inc.)
    Version:  v0.10.4
    Path:     /Users/leo/.docker/cli-plugins/docker-buildx
  compose: Docker Compose (Docker Inc.)
    Version:  v2.17.3
    Path:     /Users/leo/.docker/cli-plugins/docker-compose
  dev: Docker Dev Environments (Docker Inc.)
    Version:  v0.1.0
    Path:     /Users/leo/.docker/cli-plugins/docker-dev
  extension: Manages Docker extensions (Docker Inc.)
    Version:  v0.2.19
    Path:     /Users/leo/.docker/cli-plugins/docker-extension
....

To free up data space, can delete some unused docker image in the machine.

MySQL container can not start because of no space left on device

One time, I can not start mysql db container because it complained that there was not enough spaces. We can free up spaces by deleted orphaned volumes. Also delete images with <none> to free up spaces. Also consider clear redis cache use flush command below. You may need to restart Docker desktop

//Error
Error response from daemon: mkdir /var/lib/docker/overlay2/d49a2835b41459956e752ceddaaf0671b4e9386fc220e8b9d4697a46ad29a635-init: no space left on device
# see orphaned volumes. These volumes are not 
# referenced by any containers.
docker volume ls -qf dangling=true

#to remove
docker volume rm $(docker volume ls -qf dangling=true)

Can not start redis container

Container started, but exited right away. Before it always worked. But all of sudden, it did not work any more.

root cause is that image is updated. Because we use redis:latest, some how machine downloaded a new version of image and this image does not work for alpine linux. The old image works for alpine linux.

To solve it, we use redis:7-alpine and it works on Alpine linux.

Lesson learned: try not use image with latest tag. If use latest image and suddenly it stops working, it may because of image itself.

Clear a redis cache in Docker

docker exec -it container-name redis-cli FLUSHALL

port is used when start MYSQL container

Error response from daemon: Ports are not available: exposing port TCP 0.0.0.0:3306 -> 0.0.0.0:0: listen tcp 0.0.0.0:3306: bind: address already in use

Soulution

//in mac:  sudo launchctl unload -F /Library/LaunchDaemons/com.oracle.oss.mysql.mysqld.plist 

Download file from AWS Fargate container to local machine

aws ecs execute-command --region us-west-1 --cluster sandbox-ecs-mickdkkdroserv --task  e7b0edkdkdk4ace95052a678b896845    --container sandbox-msdbbdcontanern-1 --command "cat /var/src/utils/test.csv"  --interactive >> ~/leotest.csv

Local MySQL container can not run because of switching between mysl5.7 and mysql8.0 image

The root cause is that both volume names are the same. After use docker_mysql for Mysql 5 and use mysql84 from Mysql 8 container, I can switch between two containers.

  • #stop container
      docker-compose down
  • #find mysql volume
      docker volume ls -qf dangling=true
  • #delete mysql volume. Be careful, all database will be removed.
     #Only do it for local db!!
      docker volume rm docker_mysql
  • #restart container
      docker-compose up -d

Copy file from docker container to host machine

docker cp optimistic_mirzakhani:/var/src/phpunit.xml  ~/Desktop/.

Docker run explained

Usage	docker container run [OPTIONS] IMAGE [COMMAND] [ARG...]
//this command is used in Jenkin. Here pwd means to get the current directory
docker run --rm -v `pwd`:/var/src/ -w /var/src php:8.0.26-cli-alpine3.16  vendor/bin/browscap-php browscap:fetch

flag --rm Automatically remove the container and its associated anonymous volumes when it exits

flag -v Bind mount a volume

-w Working directory inside the container

use image php:8.0.26-cli-alpine3.16 to create a container. Mount volume `pwd`:/var/src/ (map current directory to /var/src inside container) Working directory is /var/src inside container. Then run commnand: vendor/bin/browscap-php browscap:fetch. After it is done, automatically remove the container and its associated anonymous volumes when it exits

docker run --rm -v `pwd`:/var/src/ -w /var/src/ php:8.3-cli-alpine  php ./bin/yamlToJson.php
  1. use image php:8.3-cli-alpine to create a container
  2. mount current directory to /var/src of the container
  3. inside container, use /var/src as work directory and run this command
    php ./bin/yamlToJson.php

Can not docker-compose up any container in my mac

Look like it is still because of spaces. The build cache is more than 20 GB

# can see build cache is more than 20 GB
docker system df

#clear builder cache
docker builder prune

After delete builder cache, restart Docker Destop. Everything goes normal!

entrypoint in docker-compose.yml

In a docker-compose.yml file, the entrypoint directive specifies the command that will be executed when a container starts. It overrides the default ENTRYPOINT defined in the Docker image's Dockerfile.

version: '3'
services:
    mysite:
        container_name: webpack-cart
        image: node:16.6.1-alpine3.13
        ports:
            - 8092:8092
        hostname: webpack.mysite.com
        volumes:
            - $PWD:/app:delegated
        working_dir: /app
        entrypoint: ['npm', 'run', 'build']
        stdin_open: true
        tty: true
        network_mode: bridge

The command below wll be executed when the container starts

npm run build

This command build is defined in package.json scripts section

 "scripts": {
    "build": "./node_modules/.bin/webpack serve --config webpack.development.config.js --mode development --env APP_VERSION=dev-server --env APPLICATION_ENV=local",
  },

Tuesday, 12 October 2021

Java integer overflow and binary search

The below is two solutions for Leet code 374

Solution one

public class Solution extends GuessGame {
    public int guessNumber(int n) {
        int high = n;
        int low = 1;
        
        while (low<=high) {
            int mid = (low+high)/2;
            
            if (guess(mid) == 0) {
                return mid;
            }
            
            if (guess(mid) >0) {
                low = mid +1;
            } else {
                high = mid -1;
            }
        
        }
       
        return 0;
            
    }
}

Solution two

public class Solution extends GuessGame {
    public int guessNumber(int n) {
        int high = n;
        int low = 1;
        
        while (low<=high) {
            int mid = low + (high-low)/2;
            
            if (guess(mid) == 0) {
                return mid;
            }
            
            if (guess(mid) >0) {
                low = mid +1;
            } else {
                high = mid -1;
            }
        
        }
       
        return 0;
            
    }
}

These two solutions are almost identical. However, the first solution will not pass all tests. So, what is going on? The only difference is how to calculate mid value.


//solution one
int mid = (low+high)/2;

//solution two
int mid = low + (high-low)/2;

For solution one, it will cause integer overflow for large inputs.

Sunday, 10 October 2021

JavaScript bind() method

  • we invoke the bind() on a functon
  • the argument passed into bind() is an object
  • it will return a new function. This new function becomes method of that object
class NameForm extends React.Component {
  constructor(props) {
    super(props);
    this.handleSubmit = this.handleSubmit.bind(this);
    this.input = React.createRef();
  }
  
   handleSubmit(event) {
    alert('A name was submitted: ' + this.input.current.value);
    event.preventDefault();
  }
  
 .....

 

For the above code, we need bind this. Because when we set this.handleSumit as callback of event handler, this inside that function is lost

onSubmit={this.handleSubmit}

However, we also can use arrow function for event handler. arrow function binds this lexically, so this will point to NameForm

onSubmit={()=>this.handleSubmit()}

For Promise then callback, we also need to write it as arrow function to access this of class instance.

A blog about why we need bind this

Friday, 1 October 2021

Docker networking

Docker and iptables

Docker installs two custom iptables chains named DOCKER-USER and DOCKER, and it ensures that incoming packets are always checked by these two chains first.

Use bridge networks

  • bridge is the default network driver if does not specify other driver
  • a bridge netwok allows containers connected to the same bridge network to commuicate with each other
  • bridge networks only apply to containers running on the same Docker daemon host
  • when start Docker, a default bridge network (also called bridge) is created automatically
  • newly-started containers connect to the default network unless otherwise specified

connect from a container to a service on the host

In Docker Desktop for Mac, host.docker.internal is the special DNS name which resolves to the internal IP used by host.

Therefore, if want to connect to host, use DNS name host.docker.internal if you are using docker desktop for mac.

ports mapping

In Docker file, we can expose container on some port by

EXPOSE 8080

To map to a host port, we can do the below. We assume tomcat container has exposed on port 8080

 //-p is short cut for --publish (host port to container port)
docker run -d --name tweb -p 8090:8080 tomcat
//can check port map. tweb is container name
docker port tweb

Then we can access tomcat at: http://localhost:8090

Tuesday, 28 September 2021

AWS

AWS CloudFormation intrinsic functions

The abbreviation of the intrinsic functions

Fn::Sub is identical to !Sub

Fn::!GetAtt returns the value of an attribute from a resource


Value: !GetAtt 'VM.PublicDnsName' # get VM's Public dns name attribute

Ref returns the value of the specified parameter or resource


VpcId: !Ref VPC

Fn::Sub like string concatenation


TableName: !Sub "${EnvironmentType}-user" # EnvironmentType is a parameter created elsewhere in the CloudFormation template.

Limitation

Lambda

Per region

  • Memory 128M to 10 GB (1MB increments)
  • Max execution time 15 minutes
  • Max size of environment variables 4 KB
  • /tmp 512 MB
  • Max currency 1000
  • Max zip file 50 MB
  • Uncompression file 250 MB

DynamoDB

  • Maximum size of an item is 400 KB

API Gateway

  • Default cache TTL is 300 seconds. Max is 3600 seconds

Saturday, 25 September 2021

Install rails 6.0 in Ubuntu 18

Step 1: remove ruby 2.5 because rails 6 needs ruby 2.6 and up


aptitude purge ruby

Step 2: install ruby

sudo snap install ruby --classic

Step 3: create a symbolic link in /usr/bin

sudo ln -s /snap/bin/ruby /usr/bin/ruby 

Step 4: install rails

sudo gem install rails -v 6.0.2.1 

Step 5: create a symbolic link for rails

sudo ln -s /home/leo2019/.gem/bin/rails /usr/bin/rails 

Step 6: verify

rails -v 

output: Rails 6.0.2.1

Monday, 20 September 2021

npm install and npx

npm install

If it is a new project and does not have package.json, do

npm init

module will be added as dependencies in package.json

npm install express --save 

module will be added as devDependencies in package.json

npm install mocha --save-dev

module will not be added to dependencies list and install it temporarily

npm install express --no-save

If we want to install modules listed in package.json and respect package-lock.json

npm ci 

npx

npx is package runner tool that comes with npm 5.2

  • If module is installed, npx can run command in the bin directory of the module
  • If module is not installed, when you run npx , the module will be installed and then be cleaned

Some examples


npx happy-birthday -u leo
npx create-react-app my-app

For the above examples, we are running happy-birthday and create-react-app runner tools. npx has other functionalities. For details, see Kat Marchán blog for npx

npm upgrade package

install tools to check package

npm install -g npm-check-updates

To check

npx ncu

To fix patches

npx ncu -u -t patch

To fix minor version

npx ncu -u -t minor

To fix main version

npx ncu -u -f react-datepicker 

All these fix command will only change package.json. To instll, run:

 npm install

Small syntax difference ends up different result

Java ArrayList remove function

Assume we have a Integer array list arr


    arr.add(20);
    arr.add(30);
    arr.add(1);
    arr.add(10);
    
    arr.remove(new Integer(1));

    //will return [20, 30, 10]
    System.out.println(arr);
	

    arr.add(20);
    arr.add(30);
    arr.add(1);
    arr.add(10);
    
    arr.remove(1);

    //will return [20, 1, 10]
    System.out.println(arr);
	

In the first case, we are calling remove function from public interface java.util.Collection

public boolean remove(E element)

In the second case, we are calling remove function from public interface java.util.List

public Object remove(int index)

Ruby sort


arr = [3,4,1,0]
arr.sort!
# return [0,1,3,4]
puts arr

arr = [3,4,1,0]
newArr = arr.sort
# return [3,4,1,0]
puts arr

The first case is in house sort. (use sort!). The second case will not change the original list, but return a sorted new list. The only difference is !

Wednesday, 15 September 2021

Amazon DynamoDB

Amazon DynamoDB Indexes

Primary Key

There are two kinds of primary key:

1. Partition key (aslo called hash attribute) only

2. Partition key and sort key. This kind of primary key is also called composite primary key.

The name of partition key comes from the fact that items have the key is mapping to a physical address in storage. For example, in composite primary key case, items which have the same partition key and different sort key are stored together with sorted order by sort key.

Secondary Indexes

1. Global secondary index. Can be created on items which have different partition key. Basically, can use this index to search whole table.

2. Local secondary index. Items need to have the same partition key and different sort key. Most time, this index is useless.

Secondary Index is also a table. You also need to specify primary key(partition key only or composite primary key). Also need to specify projected attributes from the base table. The primary key of the base table will be projected automatically.

Noted: In a DynamoDB table, each key value must be unique. However, the key values in a global secondary index do not need to be unique.

Using Global Secondary Indexes in DynamoDB

Amazon Dynamodb Schema

For attributes used in primary key and indexes, you need to define these attributes. However, you can only define these attributes. In fact, if you define other attributes and try to create a table, you will get error that said attributes do not match. This is because Dynamodb is a schemaless database and you can save attributes you do not define.

This is a good explanation about DynamoDB query how to query DynamoDB

Create Dynamodb table in AWS

One option is to create a cloudformation template for this table. Then deploy template


aws cloudformation deploy --template /path_to_template/my-template.json --stack-name my-new-stack --parameter-overrides Key1=Value1 Key2=Value2 

PHP code snippet to query DynamoDB

//define expression attribute names and expression attribute values. It is a key/value map
//in PHP, we use associate array as a map
//For expression attribute names, need to start with pound sign(#)
//For expression attribute values, need to start with colon(:). Also need to define type.
//Here use marshalValue to add a type. e.g {":agelimit": {"N": 21} }
$attributeNames["#typeAndStatus"] = "typeAndStatus";
$attributeValues[":typeAndStatus"] = self::$marshaller->marshalValue($typeAndStatus);
$attributeValues[":now"] = self::$marshaller->marshalValue(time());

//pass the above expression attribute names and expression attributes values in query
$queryAttributes['ExpressionAttributeNames'] = $attributeNames;
$queryAttributes['ExpressionAttributeValues'] = $attributeValues;

//Therefore, for KeyConditionExpression, we can use expression attribute names and expression attribute values
$queryAttributes['KeyConditionExpression'] = "#typeAndStatus = :typeAndStatus and nextRunTime < :now"

//query the Dynamodb client
$result = self::$client->query($queryAttributes);

DynamoDB

You can set up a DynamoDB local using Dockfile provided by AWS. After set up, you can admin db

Calculation of WCU and RCU

It is speed of size

  • One WCU is 1 KB per second. RCU is 4 KB per second. Also RCU counts on strongly consistent read
  • Item size will be round up
  • For RCU: one strongly consistent read. (== 2 eventaully consistent read)

Global Table

  • Active to Active replication between multiple region
  • Can take up to 2 seconds to do replication
  • aws:rep:updateregion contains the region in which the update was made

See ReplicationLatency Metrics

  • Go to Cloudwatch Service
  • click all metrics tab
  • Choose DynamoDB
  • Choose ReceivingRegion, TableName
  • Find Table and check replicationLatency
  • It will show up in the above chart

Tuesday, 14 September 2021

Python cheat sheet

String


# loop through
for c in "abc":
	print(c)

# string replace with return the end result. It does not change original result
date = datePart.replace("th", "")

# string split to list. X will be [welcome, to, jungle]
txt = "welcome to jungle"
x = txt.split()

# substring. will print 20
datePart = "20th"
print(datePart[0:2])

#substring to the end. will print 0th
datePart = "20th"
print(datePart[1:])

# generate an array for all lower case letters (a...z)
letters = list(string.ascii_lowercase)

#convert a decimal integer to binary string. get "111"
s1 = bin(7).replace("0b", "")

#zero left fill. The length is the length of the result string
s= "123"
# get "00123"
s=s.zfill(5)

#The count() method returns the number of times a specified value appears in the string.
print ("foobar".count("o")) # print 2

# get a char's ascii value. 'a' is 97. For code below, will return 98
print(ord('b'))

#ascii value to char. here print 'a'
print(chr(97))

#find and rfind. return 0 and 4
"abcda".find("a")
"abcda".rfind("a")

# str to int. get 9 for the code below
int("09")

hash


#create hash
hash1 = {}

#initiate hash with default data. use get to set a default value. will print out 0
print (hash1.get('a', 0))

#assigin value
hash1['a'] = 10

# access hash. print out 10
count = hash1['a']
print(count)

# check if key exist in hash. should get false
if 'c' not in hash1:
    print ("not have")
        
# loop through
for k in hash1:
    print(hash1[k])

# clear or empty a hash
hash1.clear()

# get hash keys
hash1.keys()

#decouple with hash
keys = list(pointHash.keys())

array

# append. arr becomes 1,2,4
arr = [1,2]
arr.append(4)

# create two dimension array
		dp = []
        for i in range(n):
            dp.append([10000]*n)

# find index of a element
nums = [2,3,49,1]

try:
	i = nums.index(49)
except ValueError:
	pass
#length
print(len(nums))

# join array into string
" ".join(nums)

# sort. This is in house sort
nums.sort()

# sort two dimention array by x[0], then x[1]
intervals.sort(key=lambda x:[x[0], x[1]])

# sort by x[0]
stockPrices.sort(key=lambda x:x[0])

# reverse in house sort
inventory.sort(reverse=True)

# pop at index
nums.pop(0)

# remove from the begin
nums.pop(0)

# remove from the end
nums.pop()

#initial array with 0
ans = [0] * 100

# initiate array with 0 (another way). The below will get [0,0,0,0,0]
arr=[]
arr = [0 for i in range(5)]

#reverse range
reversed(range(100))

#initialize two dimension array
dp = [[0 for x in range(m)] for y in range(m)] 

# list comprehension
 starts = [a for a, b in flowers]
 ends = [b for a, b in flowers]

Set

# create a empty set
s = set()

# add an element to set
s.add(1)

# check length of set
print(len(s))

# check contains
if 2 in s:

Binary search built in functions

bisect.bisect_left(a, x, lo=0, hi=len(a)) : Returns leftmost insertion
point of x in a sorted list. Last two parameters are optional, 
they are used to search in sublist.

bisect.bisect_right(a, x, lo=0, hi=len(a)) Returns rightmost insertion 
point of x in a sorted list a. Last two parameters are optional,
they are used to search in sublist.

index = bisect_right(arr, val)

Permutation

for p in permutations([1,2,3], 3): 
	print (p)
#output
(1, 2, 3)
(1, 3, 2)
(2, 1, 3)
(2, 3, 1)
(3, 1, 2)
(3, 2, 1)

Rest API

Send a post

import requests
import json

url = 'http://localhost:5000'
myobj = {'somekey': 'somevalue'}
headers = {'content-type':'application/json'}

x = requests.post(url, data =json.dumps( myobj), headers=headers)

print(x.text)

Math

#integer div.It will return 4
9//2

# find gcd of two integers
gcd = math.gcd(d, price)

# val is 8
val = max(3, 8)

#power. mod is optional. But if need mod, use it. It is 
#much faster than ans=pow(x,y) ans = ans%mod
pow(x, y, mod)
ans = ans + pow(2, r-i, 1000000007)

Inner Function


def countDaysTogether(self, arriveAlice: str, leaveAlice: str, arriveBob: str, leaveBob: str) -> int:
    months = [31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31]
    def getDayOfYear(dayStr:str)->int:
        arrMonth = int(dayStr[0:2])
        arrDay = int(dayStr[3:5])

Hard questions

1799. Maximize Score After N Operations

class Solution:
    myMap = {}
    def maxScore(self, nums: List[int]) -> int:
        def getM(k, nums):
            # build cache key
            cacheK = ' '.join(str(x) for x in nums)+ "k:" + str(k)
            if cacheK in self.myMap:
                return self.myMap[cacheK]

            if len(nums)==2:
                ans = k*math.gcd(nums[0], nums[1])
                self.myMap[cacheK] = ans
                return ans
            
            ans =0
            l = len(nums)
            for i in range(l-1):
                for j in range(i+1, l):
                    n1 = k*math.gcd(nums[i], nums[j])
                    left = []
                    for h in range(l):
                        if h!=i and h!=j:
                            left.append(nums[h])
                    n2 = getM(k+1, left)

                    if (n1+n2) > ans:
                        ans = n1 + n2
            self.myMap[cacheK] = ans
            return ans

        nums.sort()
        return getM(1, nums)

heap

#Leetcode 2542
class Solution:
    def maxScore(self, nums1: List[int], nums2: List[int], k: int) -> int:
        l = len(nums1)
        nums = []
        for i in range(l):
            nums.append([nums1[i], nums2[i]])
        
        #sort by the second element
        nums.sort(key=lambda x:x[1])
        nums.reverse()

        ans, curSum = 0, 0

        myHeap = []
        for i in range(k):
            curSum += nums[i][0]
            heapq.heappush(myHeap, nums[i][0])
        ans = curSum * nums[k-1][1]

        for i in range(k, l):
            out = heapq.heappop(myHeap)
            curSum = curSum-out + nums[i][0]
            heapq.heappush(myHeap, nums[i][0])
            ans = max(ans, curSum * nums[i][1])

        return ans
#Leetcode 1464
import heapq
class Solution:
    def maxProduct(self, nums: List[int]) -> int:
        for i in range(len(nums)):
            nums[i] = nums[i]*-1
        
        heapq.heapify(nums)
        # return smallest
        a = heapq.heappop(nums)
        b = heapq.heappop(nums)
       
        return (a*-1 -1) * (b*-1-1)

Run codes

#Leetcode 1992
from typing import List
class Solution:
    def findFarmland(self, land: List[List[int]]) -> List[List[int]]:
        def getFarm(f: List[int], a:int, b:int):
            
            if a<f[0] or b<f[1]:
                f[0]=a
                f[1]=b
            if a>f[2] or b>f[3]:
                f[2] = a
                f[3] = b
            return f
            
        rows = len(land)
        cols = len(land[0])

        ones = []

        # find all ones
        for i in range(rows):
            for j in range(cols):
                if land[i][j] == 1:
                    ones.append([i, j])
        
        #put ans
        ans = []
        for one in ones:
            #some one has been grouped
            if land[one[0]][one[1]] != 1:
                continue
            
            # one itself is a farmland
            x, y = one[0], one[1]
            queue = [[x,y]]
            myLand = [x, y, x, y]

            while len(queue)>0:
                size = len(queue)
                for i in range(size):
                    point = queue.pop(0)
                    a, b = point[0], point[1]

                    #left
                    if b!=0 and land[a][b-1] == 1:
                        myLand = getFarm(myLand, a, b-1)
                        land[a][b-1] = 0
                        queue.append([a, b-1])

                    #right
                    if b!=cols-1 and land[a][b+1] == 1:
                        myLand = getFarm(myLand, a, b+1)
                        land[a][b+1] = 0
                        queue.append([a, b+1])

                    #up
                    if a!=0 and land[a-1][b]==1:
                        myLand = getFarm(myLand, a-1, b)
                        land[a-1][b] = 0
                        queue.append([a-1, b])

                    #down
                    if a!=rows-1 and land[a+1][b]==1:
                        myLand = getFarm(myLand, a+1, b)
                        land[a+1][b] = 0
                        queue.append([a+1, b])
            ans.append(myLand)
        
        return ans
        
obj = Solution()
land = [[1,0,0],[0,1,1],[0,1,1]]
res = obj.findFarmland(land)
print(res)

django

commands

django-admin startproject project-name

python manage.py startapp app-name

python manage.py runserver

# open a shell to run some db query
python manage.py shell

Handle Form

# get post data
post_id = request.POST.get("post_id")

Use env variables

# create .env file in the project directory
api_key=mysecfretetemmsmsm

# in settings.py
from dotenv import load_dotenv
load_dotenv()

# to access env variable
import os
os.getenv("api_key")

var dump

from pprint import pprint
pprint(request.POST)

Versions

#find version
python -V
pip -V
python3.7 -m pip list

#show version used to store library
pip show openai

Install Python OpenAi Module

python3.7 -m pip install --upgrade pip
python3.7 -m pip install openai

Sunday, 12 September 2021

Modules in Node.js

Node.js uses CommonJS module format. It uses require to include a module. It uses module.exports to expose a modules. The npm ecosystem also uses this format.

Use require to include a module. The below we include express module.


const express = require('express')
const app = express()

app.get('/', (req, res) => {
  res.send('Hello World!')
})

const port = 2000
app.listen(port, () => {
  console.log(`listen to port 2000...`)
})

Use exports to let other codes to use this module. For example, AWS Lambda function can be written in Node.js

exports.myFunction = (event, context, callback) => {
        //do something
}

The below is a hello world module and how to use it

//in hello-world.js create a module
module.exports = name => console.log("hello to " + name)

//in main.js
var hw = require('./hello-world')
hw("kei")

//run it
node main.js //output: hello to kei
//another example
//in config.js
module.exports = {
  dbPort : 8080,
  dbHost : "etc",
  dbName : "nom",
}

//in main.js
var config = require("./config")
console.log("config:", config);
//more example
//in config
module.exports = {
  dbPort : 8080,
  dbHost : "etc",
  dbName : "nom",
  hello: (name)=> "hello to " + name
}

//in main
var leo = require("./config")

console.log(leo)

console.log(leo.hello("smith"))

//output node main.js
{
  dbPort: 8080,
  dbHost: 'etc',
  dbName: 'nom',
  hello: [Function: hello]
}
hello to smith

However, for ES6, it uses another format. It uses export and import to export and include a module. Here is post about default values in ES6 module

Monday, 6 September 2021

Java Queue

Both PriorityQueue and LinkedList implement Java Queue interface.

There are these methods. Every is a pair. The first one will throw error on failure. The second will return special value instead of throwing error.

  • add(e) offer(e)
  • remove() poll()
  • element() peek()

For LinkedList, we can call removeFirst()

Java PriorityQueue

java PriorityQueue implements java.util.AbstractQueue class which extends java.util.Collection

The head of the queue is the least element with respect to the specified ordering. However, can provide Collections.reverseOrder() in the constructor to create a max heap.

useful methods:

  • peek()
  • poll()

methods from java.util.Collection

  • size()
  • add()
  • isEmpty()

Here is a Leetcode problem leetcode 1046 which can be solved by max heap


import java.util.*;
class Solution {
    public int lastStoneWeight(int[] stones) {
        //create a max heap. The head has the max value
        var q = new PriorityQueue<Integer>(Collections.reverseOrder());

        //add element into heap
        for (int s: stones) {
            q.add(s);
        }

        while(q.size()>1) {
            int x = q.poll();
            int y = q.poll();

            if (x != y) {
            	//put result stone back into queue
                q.add(Math.abs(x-y));
            }
		}

        //check q.size
        if (q.size()==1) {
            return q.poll();
        } else {
            return 0;
        }
    }
}

Tree Level Traversal

The below is a solution for LeetCode 104

public int maxDepth(TreeNode root) {
        if (root ==null) return 0;
        
        var myq = new LinkedList<TreeNode>();
        myq.add(root);
        var ans = 0;
        
        while(!myq.isEmpty()) {
            //queue only holde nodes of current level
            var size = myq.size();
            
            //every iteration is one level because of size
            for(int i=0; i<size; i++) {
                TreeNode cur = myq.poll();
                if (cur.left!=null) myq.add(cur.left);
                if (cur.right!=null) myq.add(cur.right);
             }
            
            ans++;
        }
        
        return ans;
        
    }

Use Paire as queue element

2462

Priority Queue using custom comparator

Leetcode 2099

class Solution {

  public int[] maxSubsequence(int[] nums, int k) {
    var pq = new PriorityQueue<int[]>((a, b) -> a[1] - b[1]);

    for (int i = 0; i < nums.length; i++) {
      int[] t = { i, nums[i] };
      if (pq.size() < k) {
        pq.add(t);
      } else {
        var e = pq.peek();
        if (e[1] < nums[i]) {
          pq.poll();
          pq.add(t);
        }
      }
    }

    int[] index = new int[k];
    int j = 0;
    while (pq.size() > 0) {
      var e = pq.poll();

      index[j] = e[0];
      j++;
    }

    Arrays.sort(index);

    int[] ans = new int[k];
    j = 0;
    for (int i : index) {
      ans[j] = nums[i];
      j++;
    }

    return ans;
  }
}

array as queue element

//See Leetcode 373
PriorityQueue<int[]> minHeap = new PriorityQueue<> ((a, b) -> (a[0] + a[1]) - (b[0] + b[1]));
       
//init. the last two elements are index for two array
minHeap.add(new int[]{nums1[0], nums2[0], 0 ,0});

How to inject codes into blogger

Basically you need to add highlight.js into your blogger template. Then wrapper your code. See highlight.js usage

Here is a good tutorial about that: https://www.youtube.com/watch?v=APNWCe56cQA

Create REST API by AWS API Gateway and AWS Lambda

 We can create a REST API using AWS API Gateway and AWS Lambda by Proxy integration.

For Proxy integration, when API Gateway receives the request, it sends proxy resources such as path information and request body to Lambda function. Lambda function generates a responses based on information sent by API gateway. This response is sent back to API Gateway which send this response back to API user. In Lambda function, you can call other aws services such as store data in s3 bucket and send message to sqs before send back the response.

Step 1: Create a AWS Lamda function

Use Python as example. After create function, need to edit lambda_hander

 
import json

def lambda_handler(event, context):
    # event has info of request passed by API Gateway
    userId = event['queryStringParameters']['userId']

    # build response body
    body = {"user_id": userId, "message": "processed by Lambda"}

    # build response
    response = {'statusCode': 200, 'headers': {}}

    # let API caller know that our body is in json format
    response['headers']['content-type'] = 'application/json'
    response['body'] = json.dumps(body)

    return response

Note for node.js. In node.js, you can do

 
exports.myhandler = {event, context, callback) => {
        //get path parameters
        event.pathParamters...

        //get body
        event.body

        //get query string
        event.queryStringParameters ...

}

Note for debug:

For Python, use print something

For node.js, console.log something

Then we can see these debug info in cloudwatch


Step 2: Create a API Gateway

1. Pick Rest type

2. Create resource. Give it a name

3. Create method. We choose GET for this example.

4. In Get set up. Choose Integration type: Lambda Function. Also check "Use Lambda Proxy integration". Link the lambda function just created.


Step 3: deplay this API Gateway

Step 4: try it

find the api url and append a user id such as ?user_id=1

Step 5: add custom domain

You may want to add custom domain for this api.

Here is a good youtube video about setting up custom domain for API gateway

Here is a good youtube video about Gateway API and lamda function.