{"id":"min-time-typewriter-greedy-optimal","text":"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.","truth_value":"IN","source":"entries/2026/06/06/minimum-time-to-type-word-using-special-typewriter-solution.md","source_url":"","source_hash":"","justifications":[],"dependents":["greedy-algorithms-provably-optimal"],"metadata":{},"created_at":"","updated_at":"","reviewed_at":"","verified_at":"","retracted_at":"","explanation":{"steps":[{"node":"min-time-typewriter-greedy-optimal","truth_value":"IN","reason":"premise"}]}}