All challenges

Arrange required letter counts to reduce bigram and motif interference penalties.

Move stacked colored balls among pillars until each color occupies one pillar.

Partition a graph into balanced parts while minimizing edge cut and communication volume.

Recover a permutation from average-parity query source data.

Find a permutation whose cycle colors change at most once in a symmetric binary matrix.

Place non-overlapping advertisement rectangles to satisfy requested locations and areas.

Segment play days to maximize adventure ranks minus character-switch penalties.

Emit canonical impostor guesses for adaptive source cases.