{"id":"long-press-greedy-order","text":"The `isLongPressedName` algorithm never backtracks pointer `i`; each character in `name` is matched at most once, left to right, using a greedy two-pointer approach","truth_value":"IN","source":"entries/2026/06/06/long-pressed-name-solution.md","source_url":"","source_hash":"","justifications":[],"dependents":[],"metadata":{},"created_at":"","updated_at":"","reviewed_at":"","verified_at":"","retracted_at":"","explanation":{"steps":[{"node":"long-press-greedy-order","truth_value":"IN","reason":"premise"}]}}