Problem 3579 · Hard

Minimum Steps to Convert String with Operations

Cut word1 into contiguous pieces and turn it into the equal-length word2 using the fewest operations. Within a piece you may replace a letter, swap two letters or reverse the whole piece, and each index can take part in at most one operation of each kind.

Open the interactive visualisation