All challenges

Sort a permutation using reversals of two related segment lengths.

Sort a permutation on a tree using parallel matching swaps with as few rounds as possible.

Compute the requested smallest snake coverage values.

Sort a permutation with prefix and suffix swaps while minimizing the number of operations.

Sort a permutation by moving individual elements while minimizing the declared move cost.

Sort a permutation using cyclic shifts of one chosen segment length.

Sort a permutation while compensating for planned swaps at low energy cost.

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

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