3 Sum - Target Sum Unique Triplet
easy
1. Given an integer array 'nums', and a 'target', return all the triplets [nums[i], nums[j], nums[k]] such that i != j, i != k, and j != k. 2. Another thing is nums[i] + nums[j] + nums[k] == target. 3. Notice that the solution set must not contain duplicate triplets.
Constraints
1. 0 <= nums.length <= 3000 2. -10^5 <= nums[i] <= 10^5
Format
Input
Input is managed for you.
Output
Output is managed for you.
Example
Sample Input
6
-1 0 1 2 -1 -4
0
Sample Output
-1 -1 2
-1 0 1