greedy-skip-optimality

Status: IN

Skipping 3 positions on each `'X'` produces the minimum move count because covering the leftmost uncovered `'X'` first maximizes coverage reach and never wastes a move.

Source: entries/2026/06/06/minimum-moves-to-convert-string-solution.md

JSON