All challenges

Select big integers whose sum is as close as possible to the target.

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

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

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

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