datlife

Format /etc/passwd file

tail -n +11 /etc/passwd| sort -t$':' -k3 -n | awk -F":" \
'
 BEGIN {
    printf "GID | Name        | User_dir          | Bash_Access        | Description      \n"
    printf "--- | ----------- | ----------------- | ------------------ | -----------------\n"
 }
 {
    printf "%s | %s | %s | %s | %s\n",$3, $1, $6, $7, $5 

datlife

bqkrtxgkmriwsiwcngtivpx.info
jdtmfupdyueqeldvhsjzdvzob.net
guhmpoxzivhba.com
nqqxqhuacaqhzurde.org
lgqsqgpqzijwid.info
ykolyecdcyk.biz
ztvflnxqzpxvpfobv.biz
zqrmkpivrbxccawozqwqpfzh.org
iqyqwhntrxfeq.org
ftadkbomxlnsib.info

datlife

Status: alpha

alias k=kubectl

# Add microsoft charts to heml
helm repo add msftcharts http://microsoft.github.io/charts/repo
helm repo update

# Launch spark cluster with custom config

datlife

#!/bin/bash
# Enable fractional scaling on Ubuntu 18.04
#
# Problem:
# --------
#   - Ubuntu 18.04 runs on Gnome 3.28, whichs does not support fractional scaling (120%, 130%).
#   - As a result, the text and icon on my 4K 27" monitor are very small.
#
# Usage:
# -------

datlife

// Async should be first priority over callbacks and promises
//
// High level idea:
//   - Avoid .then .catch in promise
//   - Syntatic sugar to make async programming similar to sequential code
const axios = require('axios');
DEFAULT_URL = "https://jsonplaceholder.typicode.com"

async function getUser(id) {
    let resp = await axios.get(`${DEFAULT_URL}/users/${id}`)

datlife

Build LLVM / Clang on MacOS

Problem

Built-in Clang / LLVM shipped by Xcode does not support Leak Santizer (-fsantize=leak) feature. For example, this code has memory leak:

// File: main.c

#include <stdlib.h>

datlife

Spark Setup MacOS Guide

Reference: https://spark.apache.org/docs/latest/

Overview:

• Install Java 8+, then add to PATH and JAVA_HOME

datlife

/**  
* MIT License
*
* Copyright (c) 2018  Dat Nguyen
* Trie (aka Prefix Tree) is a type of Tree Data Structure. A node contains a
* list of child Nodes.
*
* Applications:
* ============
*    * Word completion: quickly validate if a word is correctly type.

datlife

{
    // Use IntelliSense to learn about possible attributes.
    // Hover to view descriptions of existing attributes.
    // For more information, visit: https://go.microsoft.com/fwlink/?linkid=830387
    "version": "0.2.0",
    "configurations": [
        
        {
            "name": "(lldb) Debug binary_tree",
            "type": "cppdbg",

datlife

"""Move Forward
Start from the first element in the array (A), index is i. Move forward by A[i] steps max.  
The algorithm is to return true/false, to indicate whether we can move from the first element
to the last element in the array
A = [2, 0, 1, 2, 0, 3] --> True

# Assumption:
-------------
    * A[i] > 0 and there are [1 ... N] possible steps A[i] can move if A[i] = N.