All challenges

Generate SQL seed statements that maximize coverage of the provided parser.

Generate SQL parser fuzz cases to maximize trusted coverage.

Place points inside a unit sphere while maximizing the closest-pair distance.

Identify hidden key and treasure stars through directed reachability questions.

Recover the sorted array from mode-query source data.

Compute the requested smallest snake coverage values.

Choose table factors and optional discarded observations for a weighted multiplication poster fit.

Optimize a Boolean assignment for a compact three-literal CNF instance.

Slide tiles so the resulting line drawing contains a large tree.

Visit ordered targets on a skating rink using moves, slides, and block alterations.

Recover hidden node signs in a rooted tree using path-sum and toggle queries.

Choose shuttle pads under budget to reduce travel distances between ship endpoints.