Dr.Q quinsulon

ANNOUNCEMENT

I have moved this over to the Tech Interview Cheat Sheet Repo and has been expanded and even has code challenges you can run and practice against!

\

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?

GPL3 LICENSE SYNOPSIS

TL;DR* Here's what the license entails:

1. Anyone can copy, modify and distribute this software.
2. You have to include the license and copyright notice with each and every distribution.
3. You can use this software privately.
4. You can use this software for commercial purposes.
5. If you dare build your business solely from this code, you risk open-sourcing the whole code base.

	using UnityEngine;
	using System.Collections;

	public class CameraShake : MonoBehaviour
	{
	// Transform of the camera to shake. Grabs the gameObject's transform
	// if null.
	public Transform camTransform;

	// How long the object should shake for.

	// Promise.all is good for executing many promises at once
	Promise.all([
	promise1,
	promise2
	]);

	// Promise.resolve is good for wrapping synchronous code
	Promise.resolve().then(function () {
	if (somethingIsNotRight()) {
	throw new Error("I will be rejected asynchronously!");

	<?xml version="1.0" encoding="UTF-8"?>
	<!--
	# Goes inside %APPDATA%\kodi\userdata
	-->
	<playercorefactory>
	<players>
	<player name="VLC" type="ExternalPlayer" audio="false" video="true">
	<filename>/usr/bin/vlc</filename>
	<hidexbmc>true</hidexbmc>
	<hideconsole>true</hideconsole>

	# Implementation of a chinese restaurant process function for a given list of word vectors.
	def crp(vecs):
	clusterVec = [[0.0] * 25] # tracks sum of vectors in a cluster
	clusterIdx = [[]] # array of index arrays. e.g. [[1, 3, 5], [2, 4, 6]]
	ncluster = 0
	# probablity to create a new table if new customer
	# is not strongly "similar" to any existing table
	pnew = 1.0/ (1 + ncluster)
	N = len(vecs)
	rands = [random.random() for x in range(N)] # N rand variables sampled from U(0, 1)

	import java.util.SortedMap;
	import java.util.TreeMap;

	public class ConsistentHashing {

	// Consistent Hashing with Ring having 50 buckets.
	final static int LIMIT = 50;

	// Sorted Map.
	final static SortedMap<Integer, String> bucketIdToServer = new TreeMap<>();