A robot is located at the top-left corner of a m x n grid. The robot can only move either down or right at any point in time. The robot is trying to reach the bottom-right corner of the grid. How many possible unique paths are there?

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

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.

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

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

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