All challenges

Recover the hidden permutation used by pairwise bitwise-or queries.

Sort a permutation using reversals of two related segment lengths.

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

Recover a mutable hidden permutation through value-segment queries and swaps.

Interactively recover a hidden permutation using match-count queries.

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

Partition a permutation into four subsequences to maximize LIS and LDS structure.

Find indices holding the two median permutation values.

Recover a hidden limited-shuffle permutation using comparison queries.

Recover a hidden cyclic lamp permutation through the original Frontier-CS adjacency interaction.

Recover a hidden permutation from interactive subarray inversion-parity queries.

Build requested interval-value sets by emitting valid monotone merge operations.