Sort a permutation with prefix and suffix swaps while minimizing the number of operations.
All challenges
Place reflected and rotated polyominoes in a rectangle while minimizing occupied area.
Emit a deterministic static poker policy for Frontier-CS hand seeds.
Emit a simple valid move script for the pet shelter simulation instance.
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.
Order the fastest pepes from the source racing instances.
Plan a closed patrol route that sees all road cells while keeping travel cost low.
Transform one valid parenthesis sequence into another using limited structural operations.
Recover the binary grid from palindromic-path source data.