All challenges

Draw a square grid map whose color adjacencies exactly realize a country graph while minimizing K/N.

Choose sets covering every element while minimizing total cost.

Select a small vertex cover for an undirected graph.

Construct a high-value increasing sequence with strictly increasing adjacent gcds.

Choose a vertex service order on a tree whose removals flip unserviced neighbors.

Choose item counts for a two-constraint packing instance and maximize total treasure value.

Add derivable shortcuts to a path DAG so every ordered pair is reachable within three edges.

Move soil with a truck to level a grid while minimizing loading, travel, and unloading cost.

Choose ten bounded interval shifts and report the resulting longest increasing subsequence length.

Fit a compact symbolic expression to a source-derived regression dataset.

Fit a compact symbolic expression to a source-derived regression dataset.

Fit a compact symbolic expression to a source-derived regression dataset.