Hun Jae Lee hunj

Keybase proof

I hereby claim:

I am hunj on github.
I am hunj (https://keybase.io/hunj) on keybase.
I have a public key ASAJoF7vcKllXYF7TfPzomysgiHFM0Q53xtHso0p8TAv0wo

To claim this, I am signing this object:

Howdy Y'all! I'm @kordless on YouTube and I occasionally play and stream Rust, the game.

This repo is for deploying a Rust Server running on Google Container Engine. Google has a deal going where you can get $300 of free credits for a year on Google Cloud, so it's a good excuse to signup and run your own server. And no, I don't work for Google!

This deployment uses an image built by @dids, which is hosted on Docker Hub: https://hub.docker.com/r/didstopia/rust-server/

This deployment method can be used to start a small server to play with friends or practice building things. In a few days, I'll update the scripts to include a way to save the content you've created, in-game, with others who can then run their own servers and load your content in to explore it for themselves.

For now, start by navigating to Google Cloud and signup for an account. You'll need to enter some credit card details to get this going, but Google is giving you $300 in credits for the next year. Should be e

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.

	import inspect

	frame = inspect.currentframe()
	args, _, _, values = inspect.getargvalues(frame)
	print('function name "%s"' % inspect.getframeinfo(frame)[2])
	for i in args:
	print(" %s = %s" % (i, values[i]))

	from decimal import *

	def compute_pi():
	pi = Decimal(3.0)
	curr_multiplier = Decimal(2)
	iteration = Decimal(0)
	load = Decimal(1)
	getcontext().prec = 6

	while 1:

	require 'benchmark'

	the_number = 600_851_475_143

	# monkeypatching
	class Fixnum
	def prime? # O(n)
	(2..(self - 1)).each do \|divisor\|
	return false if self % divisor == 0
	end

	require 'csv'

	# Data generation
	@data = {}

	(0..100).each do \|i\|
	@data[i] = {
	:age => Random.rand(18...80),
	:gender => Random.rand(0..1),
	:prescription_history => []

	def perfect_number? number
	return number == divisors_of(number)
	end

	def divisors_of number
	arr = []
	(1..number).each do \|iter\|
	if number % iter == 0
	arr << iter
	end

	DESIRED_SIZE = 1073741824 # 1gb
	FILE_NAME = "dummy" # name of the dummy file

	dummy_file = File.new(FILE_NAME, "w")

	while dummy_file.size < DESIRED_SIZE
	dummy_file.write([0,1].sample)
	end

	dummy_file.close