{"id":"max69-greedy-leftmost","text":"Replacing the leftmost 6 with 9 is provably optimal because higher-order digit positions have exponentially greater value; `str.replace` with count=1 naturally targets this position.","truth_value":"IN","source":"entries/2026/06/06/maximum-69-number-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":"max69-greedy-leftmost","truth_value":"IN","reason":"premise"}]}}