Data Structures & Algorithms

Advanced Algorithms: Levenshtein Distance

August 02, 2019 • ☕️ 5 min read

The Levenshtein distance is a string metric for measuring the difference between two sequences.

Advanced Algorithms: Rabin–Karp

July 25, 2019 • ☕️ 3 min read

The Rabin–Karp algorithm seeks to speed up the testing of equality of the pattern to the substrings in the text by using a hash function.

Advanced Algorithms: Topological Sorting

July 23, 2019 • ☕️ 2 min read

In the field of computer science, a topological sort or topological ordering of a directed graph is a linear ordering of its vertices

Advanced Algorithms: Floyd–Warshall

July 22, 2019 • ☕️ 3 min read

Floyd–Warshall is an algorithm for finding shortest paths in a weighted graph with positive or negative edge weights but with no negative cycles.

Advanced Data Structures: Bloom Filter

July 20, 2019 • ☕️ 4 min read

A bloom filter is a space-efficient probabilistic data structure designed to test whether an element is present in a set.

Advanced Algorithms: Polynomial Rolling Hash

July 17, 2019 • ☕️ 3 min read

The Rabin–Karp string search algorithm is often explained using a very simple rolling hash function that only uses multiplications and addition.