โ† Directi questions

Minimum operations between two string states with special swaps

Filed under Directi

The question

Given an initial state string I and a final state string F containing 'a', 'b', and one empty slot '_', find the minimum number of operations to reach F from I. Allowed operations are swapping the empty slot with any adjacent character, or jumping over an adjacent character into the next position only if the adjacent character differs from the one jumped over.

No write-up yet. Related questions below have one.

Related Directi questions

Collected from public candidate posts and coding forums. Updated Nov 2026.