All challenges

Find the hidden pair associated with the large integer source instance.

Determine a hidden cycle size through the original Frontier-CS walk-and-guess interaction.

Identify hidden AND/OR gates in a switch-controlled circuit.

Decide whether a hidden graph is bipartite using the original edge-count query protocol.

Report cycle lengths of functional graphs from hedgehog source instances.

Compute the total weight in a heap-indexed tree source instance.

Find a long no-repeat path in a directed graph and score by path-length thresholds.

Optimize batched CUDA matrix multiplication across grouped shapes.

Produce source-grid routes for noisy path-feedback instances.

Trap a moving robot on the grid through the original Frontier-CS turn-by-turn interaction.

Find a simple grid path that visits required row intervals in a valid order.

Recover a rooted tree from antichain greedy black-box queries.