Status: IN
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.
Two-pointer subsumes multiple problem families into a single O(n) framework
Depends on (SL): two-pointer-convergence-linear-time, two-pointer-sorted-array-pattern, two-pointer-backward-fill-avoids-sort, sort-then-two-pointer-pattern