Posts
-
What is the Maker-Maker fee structure?
Some exchanges, such as Binance work on a maker-taker fee structure. This means that the fee they charge is different for the makers and for the takers.
-
Postgresql index usage
Ever wonder if your indices are properly used in your postgres database? Wonder no more!
-
Mock within a mock
Mocks returning mocks, returning mocks; unit testing legacy systems sure is a drag.
-
Clojure Adventures: An URL Shortener
Lately, I’ve been tinkering with Clojure, and my latest weekend project is a URL shortener à la bitly. Turns out, URL shorteners are not black magic!
-
Formal Search Techniques Pt. 1
Search is one of the corner stones of artificial intelligence. Search techniques are general problem solving methods, which mean that they do not require any knowledge specific to the problem space. All they need is a set of states, a set of operators, an initial state, and a goal criterion. It is possible to solve a wide variety of problems with these simple components.
-
Kruskal and the Disjoint Sets
Given a connected and undirected graph, a spanning tree of that graph is a tree that connects all the vertices together. Given that a weight is assigned to every edge, the spanning tree’s weight is computed by summing the weights of the edges within that spanning tree. A minimum spanning tree (MST) is a spanning tree with weight less than or equal to the weight of every other spanning tree of that graph.
-
About Interval Trees
Binary trees are simple data structures. However, multiple enhancements can be done to make them a lot more interesting. Interval trees only require a simple binary tree augmentation, but can be used to solve non-trivial problems.
-
Don't Panic
Last Friday, I accidentally deleted the wrong git branch. That’s right, I’m a silly, silly programmer.
-
What is a trie, anyway?
The only missing feature from your latest product which will make the world a better place is autocompletion. You are therefore tasked with implementing the following interface: