Artem Zinoviev artemzi

Nerd Fonts for your IDE

https://www.nerdfonts.com/font-downloads

The following solution thanks to @hackerzgz & @snacky101 will install all nerd fonts;

brew tap homebrew/cask-fonts
brew search '/font-.*-nerd-font/' | awk '{ print $1 }' | xargs -I{} brew install --cask {} || true

System Design Cheatsheet

Picking the right architecture = Picking the right battles + Managing trade-offs

Basic Steps

Clarify and agree on the scope of the system

User cases (description of sequences of events that, taken together, lead to a system doing something useful)
- Who is going to use it?
- How are they going to use it?

Studying for a Tech Interview Sucks, so Here's a Cheat Sheet to Help

This list is meant to be a both a quick guide and reference for further research into these topics. It's basically a summary of that comp sci course you never took or forgot about, so there's no way it can cover everything in depth. It also will be available as a gist on Github for everyone to edit and add to.

Data Structure Basics

###Array ####Definition:

Stores data elements based on an sequential, most commonly 0 based, index.
Based on tuples from set theory.

Moved to git repository: https://github.com/denji/golang-tls

Generate private key (.key)

# Key considerations for algorithm "RSA" ≥ 2048-bit
openssl genrsa -out server.key 2048

# Key considerations for algorithm "ECDSA" ≥ secp384r1
# List ECDSA the supported curves (openssl ecparam -list_curves)

	Below are the Big O performance of common functions of different Java Collections.


	List \| Add \| Remove \| Get \| Contains \| Next \| Data Structure
	---------------------\|------\|--------\|------\|----------\|------\|---------------
	ArrayList \| O(1) \| O(n) \| O(1) \| O(n) \| O(1) \| Array
	LinkedList \| O(1) \| O(1) \| O(n) \| O(n) \| O(1) \| Linked List
	CopyOnWriteArrayList \| O(n) \| O(n) \| O(1) \| O(n) \| O(1) \| Array

	Latency Comparison Numbers (~2012)
	----------------------------------
	L1 cache reference 0.5 ns
	Branch mispredict 5 ns
	L2 cache reference 7 ns 14x L1 cache
	Mutex lock/unlock 25 ns
	Main memory reference 100 ns 20x L2 cache, 200x L1 cache
	Compress 1K bytes with Zippy 3,000 ns 3 us
	Send 1K bytes over 1 Gbps network 10,000 ns 10 us
	Read 4K randomly from SSD* 150,000 ns 150 us ~1GB/sec SSD

	- General
	[ ] The code works
	[ ] The code is easy to understand
	[ ] Follows coding conventions
	[ ] Names are simple and if possible short
	[ ] Names are spelt correctly
	[ ] Names contain units where applicable
	[ ] Enums are used instead of int constants where applicable
	[ ] There are no usages of 'magic numbers'
	[ ] All variables are in the smallest scope possible

	# Backup
	docker exec CONTAINER /usr/bin/mysqldump -u root --password=root DATABASE > backup.sql

	# Restore
	cat backup.sql \| docker exec -i CONTAINER /usr/bin/mysql -u root --password=root DATABASE

	package main

	import (
	"fmt"
	"io"
	"io/ioutil"
	"net"
	"os"
	"strings"