{"id":"two-pointer-convergence-linear-time","text":"The converging two-pointer pattern in `reverse-only-letters` runs in O(n) time because each pointer advances monotonically inward, collectively visiting each index at most once.","truth_value":"IN","source":"entries/2026/06/06/reverse-only-letters-solution.md","source_url":"","source_hash":"","justifications":[],"dependents":["two-pointer-primary-linear-array-technique"],"metadata":{},"created_at":"","updated_at":"","reviewed_at":"","verified_at":"","retracted_at":"","explanation":{"steps":[{"node":"two-pointer-convergence-linear-time","truth_value":"IN","reason":"premise"}]}}