After sorting, fix one element and reduce to TwoSum = −pivot on the remainder.

Two pointer works because the array is sorted — move L right to increase sum, R left to decrease sum.

Skip duplicates by checking adjacent values to avoid repeated triplets.