Sort and two pointersMedium

3Sum

Find every different triplet of numbers in nums that adds up to zero, with no triplet listed twice.

Aim for O(n²) time, O(1) extra spaceInspired by a classic interview problem ↗