Poyters
Solo building robust Elixir library for math, data structures & algorithms.
Comprehensive guide to understanding and calculating Big O notation for evaluating algorithm complexity with practical examples in TypeScript.
A practical introduction to sparse ordering - a simple technique for maintaining ordered lists in databases without constant renumbering.