All challenges

Color a large graph with three colors while minimizing conflicts.

Recover a hidden cyclic lamp permutation through the original Frontier-CS adjacency interaction.

Construct a long non-revisiting knight path from a requested start square.

Print a connected acyclic grid map that resists gathering agents under random moves.

Choose machine orders for a job-shop instance to minimize makespan.

Hire optional residents as shuttle routes to reduce weighted travel demand over islands.

Recover a hidden permutation from interactive subarray inversion-parity queries.

Construct a small binary grid with exactly the requested number of monotone paths.

Build requested interval-value sets by emitting valid monotone merge operations.

Construct a compact weighted DAG whose paths represent exactly one integer interval.

Recover hidden derangements through the original Inter Active permutation query protocol.

Select two pens with enough remaining hidden ink after interactive write tests.