three-parts-linear-complexity

Status: IN

The algorithm performs exactly one pass over the array after the initial sum, achieving O(n) time and O(1) auxiliary space

Source: entries/2026/06/06/partition-array-into-three-parts-with-equal-sum-solution.md

JSON