All challenges

Recover hidden derangements through the original Inter Active permutation query protocol.

Construct a permutation whose increasing-subsequence count matches the target value.

Find a vertex permutation that maximizes matched edges between two graphs.

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

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

Permute names to reduce substring complaint costs over adjacent pairs.

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

Recover a hidden permutation using interactive pairwise bitwise-OR queries.

Assign facilities to locations to reduce binary flow-distance cost.

Recover a permutation from average-parity query source data.

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