Problem 801 · Hard

Minimum Swaps To Make Sequences Increasing

Make two aligned arrays strictly increasing using the fewest swaps of equal-index pairs. The visual tracks two running costs, one for leaving each index unswapped and one for swapping it.

Open the interactive visualisation