Sort a grid into snake order with adjacent swaps
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.
UberTechnical phone screenNo answer yet. Write the first one; the best answer gets endorsed.