def test_three_sum(self):
self.assertSetEqual(three_sum([-1, 0, 1, 2, -1, -4]), {(-1, 0, 1),
(-1, -1, 2)})
self.assertSetEqual(three_sum([-1, 3, 1, 2, -1, -4, -2]),
{(-4, 1, 3), (-2, -1, 3), (-1, -1, 2)})
def test_three_sum(self):
self.assertSetEqual(three_sum([-1, 0, 1, 2, -1, -4]),
{(-1, 0, 1), (-1, -1, 2)})
self.assertSetEqual(three_sum([-1, 3, 1, 2, -1, -4, -2]),
{(-4, 1, 3), (-2, -1, 3), (-1, -1, 2)})
"""
Given an array S of n integers, are there three distinct elements
a, b, c in S such that a + b + c = 0?
Find all unique triplets in the array which gives the sum of zero.
Note: The solution set must not contain duplicate triplets.
For example, given array S = [-1, 0, 1, 2, -1, -4],
A solution set is:
{
(-1, 0, 1),
(-1, -1, 2)
}
"""
from algorithms.arrays import three_sum
S = [-1, 0, 1, 2, -1, -4]
print(three_sum(S))