tricks of bit manipulation
key takeaways from Robert Sapolsky
a glimpse into competitive programming
when linear algebra meets distributed computing
a computational approximation of human mind
algorithms from graph theory
heap, huffman codes, optimal binary search tree, union-find, bloom-filter
"When things go our way we reject the lack of certainty."