Skip to content

Instantly share code, notes, and snippets.

View evanchen7's full-sized avatar

Evan Chen evanchen7

View GitHub Profile
WIP
# MacOS Setup
# https://sourabhbajaj.com/mac-setup/
# The following commands will greatly increase the accessibility of your Mac during development.
```
chflags nohidden ~/Library
defaults write com.apple.finder AppleShowAllFiles YES
defaults write com.apple.finder ShowPathbar -bool true

Keybase proof

I hereby claim:

  • I am evanchen7 on github.
  • I am evanchen (https://keybase.io/evanchen) on keybase.
  • I have a public key ASDd6BtfgraWk1r4qEeKIvPXPNeIQ5mCF6TX-ygfNjnbmQo

To claim this, I am signing this object:

Keybase proof

I hereby claim:

  • I am evanchen7 on github.
  • I am evanchen7 (https://keybase.io/evanchen7) on keybase.
  • I have a public key ASAzZZC8AXab3QNRr6AxtghnvXVvjRkuajQlg_01cRh_eAo

To claim this, I am signing this object:

@evanchen7
evanchen7 / hashTable.js
Created July 28, 2017 01:06 — forked from alexhawkins/hashTable.js
A Simple Hash Table in JavaScript
/*HASH TABLE - a dictionary/hash map data structure for storing key/value pairs. Finding
an entry in a hash table takes O(1) constant time(same for 10 as 1 billion items). Whereas
finding an item via binary search takes time proportional to the logarithm of
the item in the list O(logn). Finding an item in a regular old list takes time proportional to
the length of the list O(n). Very slow. Hash Tables = very fast */
var makeHashTable = function(max) {
var storage = [],
hashTableMethods = {