← Questions
Sort a grid into snake order with adjacent swaps
0
I was asked this
No reports yet. Sign in to say where you were asked it.
An n x n board holds each number from 1 to n*n once. Rearrange it into snake order: the first row increases left to right, the second right to left, and so on, alternating.
The only move swaps two cells that share an edge. Return any sequence of swaps that reaches snake order.
No official answer yet. Write yours on the right and run it.
Nothing published yet.
Sign in to submit your code; every attempt is kept here.
Write and test your solution herePython in your browser, the question's tests level by level, every submission kept for you.Sign in to start coding