Status: IN
Processing characters left-to-right with shortest-arc moves is provably optimal for the typewriter problem; no lookahead or reordering can reduce total time because the pointer must visit each character in sequence.
Source: entries/2026/06/06/minimum-time-to-type-word-using-special-typewriter-solution.md