{"id":"two-pointer-primary-linear-array-technique","text":"Converging two-pointer patterns — forward/backward fill, inward squeeze, and sorted-pair matching — are the dominant technique for achieving O(n) time on array pair and partition problems.","truth_value":"IN","source":"","source_url":"","source_hash":"","justifications":[{"type":"SL","antecedents":["two-pointer-convergence-linear-time","two-pointer-sorted-array-pattern","two-pointer-backward-fill-avoids-sort","sort-then-two-pointer-pattern"],"outlist":[],"label":"Two-pointer subsumes multiple problem families into a single O(n) framework"}],"dependents":["sort-then-two-pointer-dominant-pair-pipeline","two-pointer-is-dual-cursor-streaming"],"metadata":{"last_reviewed":"2026-06-07T22:02:22","review_result":"pass"},"created_at":"","updated_at":"","reviewed_at":"","verified_at":"","retracted_at":"","explanation":{"steps":[{"node":"two-pointer-primary-linear-array-technique","truth_value":"IN","reason":"SL justification valid","antecedents":["two-pointer-convergence-linear-time","two-pointer-sorted-array-pattern","two-pointer-backward-fill-avoids-sort","sort-then-two-pointer-pattern"],"label":"Two-pointer subsumes multiple problem families into a single O(n) framework"},{"node":"two-pointer-convergence-linear-time","truth_value":"IN","reason":"premise"},{"node":"two-pointer-sorted-array-pattern","truth_value":"IN","reason":"premise"},{"node":"two-pointer-backward-fill-avoids-sort","truth_value":"IN","reason":"premise"},{"node":"sort-then-two-pointer-pattern","truth_value":"IN","reason":"premise"}]}}