{"id":"three-pointer-linear-time-constant-space","text":"The three-pointer intersection algorithm runs in O(n1 + n2 + n3) time with O(1) auxiliary space by always advancing the pointer at the smallest current value.","truth_value":"IN","source":"entries/2026/06/06/intersection-of-three-sorted-arrays-solution.md","source_url":"","source_hash":"","justifications":[],"dependents":[],"metadata":{},"created_at":"","updated_at":"","reviewed_at":"","verified_at":"","retracted_at":"","explanation":{"steps":[{"node":"three-pointer-linear-time-constant-space","truth_value":"IN","reason":"premise"}]}}