3Sum

This problem is part of solulu Pro

Given an integer array nums, return every distinct triplet [a, b, c] of values taken from three different positions such that a + b + c = 0. The result must not contain the same triplet twice. Triplets and the values…