3Sum

Given an integer array, print all unique triplets [a, b, c] with a + b + c = 0. Each triplet is printed in non-decreasing order and triplets are printed in lexicographic order. Print nothing if there is no triplet.

3 <= n <= 3000 -10^5 <= nums[i] <= 10^5