A tag is a keyword or label that categorizes your question with other, similar questions. Using the right tags makes it easier for others to find and answer your question.
Questions about methods and techniques to prove correctness of programs.
the algorithmic problem of ordering a set of elements with respect to some ordering relation.
Asymptotic analyses of the space needed to run algorithms.
The spanning tree of a connected undirected graph G is a tree having all the vertices and some number of edges of G.
a Last In First Out (LIFO) data structure. A common use of stacks is to store subroutine arguments and return addresses.
Streaming reads the data once, in sequence.
problems where given a sting / a set of strings, the goal is to compute a string satisfying given constraints (usually resulting from input string(s) by adding, removi…
Use for generic string matching that may be exact substring matching (though then prefer the tag `exact-string-matching`), may be matching to a regular expression, or may be approximate matching (e.g.…
Questions about different distance metrics on strings.
Questions about sequences of symbols, sets thereof and their properties as well as uses.
Questions about algorithms related to subsequences, or about properties of subsequences.
Questions about algorithms related to substrings, or about properties of substrings.
a puzzle that requires filling a 3x3 grid of 3x3 sub-grids in a way that each column, row and sub-grid contains every digit from 1 to 9.
Questions about Support Vector Machines. SVMs are supervised learning models used for classification and regression tasks.
Questions about techniques for enforcing an agreed order of events between several concurrently executing threads. Specific synchronization mechanisms include mutexes (locks), condition variables, se…