A solution set is: [ [-1, 0, 1], [-1, -1, 2] ] The tricky bit is to deal with the duplicated triplets. We could use a hash set to avoid the duplicate triplets. Bruteforce Algorithm to Search For Every Possible triplets O(N^3) We can first sort the numbers, and bruteforce ea...