Find All Triplets with Sum Zero in Python

def find_triplets(nums):
    nums.sort()
    n = len(nums)
    triplets = []
    for i in range(n - 2):
        if i > 0 and nums[i] == nums[i - 1]:
            continue
        left, right = i + 1, n - 1
        while left < right:
            total = nums[i] + nums[left] + nums[right]
            if total == 0:
                triplets.append([nums[i], nums[left], nums[right]])
                left += 1
                right -= 1
                while left < right and nums[left] == nums[left - 1]:
                    left += 1
                while left < right and nums[right] == nums[right + 1]:
                    right -= 1
            elif total < 0:
                left += 1
            else:
                right -= 1
    return triplets

if __name__ == "__main__":
    test_array = [-1, 0, 1, 2, -1, -4]
    result = find_triplets(test_array)
    print(f"Array: {test_array} → sorted: {sorted(test_array)}")
    print(f"Unique triplets summing to zero: {result}")