3Sum

Given an integer array, print all unique triplets whose values sum to 0. Input format: - First line: n - Second line: n integers Sort each triplet in nondecreasing order. Print unique triplets in lexicographic order, one triplet per line. Print `EMPTY` if no triplet exists.

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

6
-1 0 1 2 -1 -4

-1 -1 2
-1 0 1

3
0 1 1

EMPTY