All challenges

Reconstruct a toroidal character matrix that contains many observed strings.

Synthesize a short A=B rewriting program for substring detection test families.

Create binary magic words and identify ordered pairs from distinct-substring powers.

Type a string containing all lucky words while minimizing keyboard movement cost.

Output a long common subsequence of two strings.

Produce an edit transcript that captures a long common subsequence alignment.

Compute the probability that a random DNA string matches at least one wildcard pattern.

Recover the hidden DiverC dictionary through the original autofill query service.

Permute names to reduce substring complaint costs over adjacent pairs.

Recover a hidden bracket string through the original regular-substring query protocol.

Count binary substrings whose number of zeroes equals the square of the number of ones.

Recover a hidden binary slate string through the original Frontier-CS interactive machine.