All challenges

Partition dangos into sticks containing one of each color.

Find the hidden chord in a cycle by querying shortest-path distances.

Place equal spheres in a unit cube to maximize the inferred common radius.

Optimize a Triton cross-entropy loss kernel against PyTorch GPU baselines.

Recover the relative offsets of concentric lock rings from a Frontier-CS interactive source instance.

Construct a completely multiplicative +/-1 function with small prefix imbalance.

Choose relay stations and links to connect robots with low communication cost.

Sort colored balls across poles using capacity-constrained top-ball moves.

Design low-cost multi-cloud broadcast routes under throughput and bandwidth constraints.

Partition graph vertices into as few clique groups as possible.

Design a two-choice transition plan whose long-run visit counts match target cleaning duties.

Recover the circular order of doors from Frontier-CS source data.