Shobith Alva shobith

GROKKING NOTES

I liked the way Grokking the coding interview organized problems into learnable patterns. However, the course is expensive and the majority of the time the problems are copy-pasted from leetcode. As the explanations on leetcode are usually just as good, the course really boils down to being a glorified curated list of leetcode problems.

So below I made a list of leetcode problems that are as close to grokking problems as possible.

Pattern: Sliding Window

Download and install the font

Download the Consolas font from http://www.fontpalace.com/font-details/Consolas/
Open Finder and navigate to Downloads directory
Double click the Consolas.ttf file
A dialog box appears displaying the details about the font
Click Install font button

Using Consolas font on IntelliJ IDEA:

Open IDEA Preferences Window (Press Command + ,)
Editor > Colors & Fonts > Font

Git Cheat Sheet

Commands

Getting Started

git init

or

2015-01-29 Unofficial Relay FAQ

Compilation of questions and answers about Relay from React.js Conf.

Disclaimer: I work on Relay at Facebook. Relay is a complex system on which we're iterating aggressively. I'll do my best here to provide accurate, useful answers, but the details are subject to change. I may also be wrong. Feedback and additional questions are welcome.

What is Relay?

Relay is a new framework from Facebook that provides data-fetching functionality for React applications. It was announced at React.js Conf (January 2015).

	from TwitterAPI import TwitterAPI
	import json
	import logging
	import time
	from collections import OrderedDict
	from random import random

	"""
	Assume 3 participants. You will need to create a Twitter account for each participant, and get API keys for each one.
	"""

	#!/usr/bin/env xcrun swift -O

	/*
	gen.swift is a direct port of cfdrake's helloevolve.py from Python 2.7 to Swift 3
	-------------------- https://gist.github.com/cfdrake/973505 ---------------------
	gen.swift implements a genetic algorithm that starts with a base
	population of randomly generated strings, iterates over a certain number of
	generations while implementing 'natural selection', and prints out the most fit
	string.
	The parameters of the simulation can be changed by modifying one of the many

	"**************************************************************************
	* Allowable characters: *
	* - a-z *
	* - A-Z *
	* - 0-9 *
	* - .+/\~<>@%\|&?
	* - blank, tab, cr, ff, lf *
	* *
	* Variables: *
	* - variables must be declared before use *

	Promised speed:

	0.1s https://dl.dropboxusercontent.com/s/bpgountdjrbs17n/2014-06-09%20at%2019.00.png

	Actual speed:

	575s https://dl.dropboxusercontent.com/s/2kbn5p1g4t03fvl/2014-06-09%20at%2019.00%20%281%29.png

	With optimizations: