Leetcode 15. 3Sum

Find all unique triplets in an integer array that sum to zero, ensuring no duplicate triplets in the output. The core challenge is efficiently enumerating combinations (commonly done by sorting and using a two-pointer scan) within the 3 ≤ n ≤ 3000 constraint.