Posts
-
When the Iteration Loop Stops Being Local
Our product needed fast credential validation when users connected external systems. The platform already had credential infrastructure, so reusing it felt obvious.
-
What is the Maker-Taker 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.
-
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.
-
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: