@@ -0,0 +1,339 @@
+# Given an array S of n integers, are there 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.%0A%0A# Note: The solution set must not contain duplicate triplets.%0A%0A# For example, given array S = %5B-1, 0, 1, 2, -1, -4%5D,%0A%0A# A solution set is:%0A# %5B%0A#   %5B-1, 0, 1%5D,%0A#   %5B-1, -1, 2%5D%0A# %5D%0A%0A

add 15