{"id":"three-parts-linear-complexity","text":"The algorithm performs exactly one pass over the array after the initial sum, achieving O(n) time and O(1) auxiliary space","truth_value":"IN","source":"entries/2026/06/06/partition-array-into-three-parts-with-equal-sum-solution.md","source_url":"","source_hash":"","justifications":[],"dependents":[],"metadata":{},"created_at":"","updated_at":"","reviewed_at":"","verified_at":"","retracted_at":"","explanation":{"steps":[{"node":"three-parts-linear-complexity","truth_value":"IN","reason":"premise"}]}}