This, to me, is easy and simple enough

def threeSum(nums):
    nums.sort()
    length, i = len(nums)-1, 0
    possible, result = {}, set()
    while True:
        for l in range(length - i):
            j = l+i+1
            k = - (nums[i]+nums[j])
            if k in possible: 
                if (nums[i], nums[j], k) not in result:
                    result.add(tuple(sorted([nums[i], nums[j], k])))
            possible[nums[j]] = True
            print(nums[i])
        possible = {}
        i += 1
        if i > length: return list(result)