Given an integer array nums, return all the triplets `[nums[i], nums[j], nums[k]]`

such that `i != j`

, `i != k`

, and `j != k`

, and `nums[i] + nums[j] + nums[k] == 0`

.

Notice that the solution set must not contain duplicate triplets.

**Example 1:**

Input:nums = [-1,0,1,2,-1,-4]Output:[[-1,-1,2],[-1,0,1]]Explanation:nums[0] + nums[1] + nums[2] = (-1) + 0 + 1 = 0. nums[1] + nums[2] + nums[4] = 0 + 1 + (-1) = 0. nums[0] + nums[3] + nums[4] = (-1) + 2 + (-1) = 0. The distinct triplets are [-1,0,1] and [-1,-1,2]. Notice that the order of the output and the order of the triplets does not matter.

**Example 2:**

Input:nums = [0,1,1]Output:[]Explanation:The only possible triplet does not sum up to 0. Solution : Java :

**Solution **:Approaches

As array has both -ve and +ve numbers, firstly we sort the array. Sorted array would have -ve numbers together and +ve numbers together in an increasing order. This will make easy for searching the required numbers to make a 0 sum.

**Base cases after sorting:**

**If array size is < 3, **means n**o triplet would exist** from that array. Return empty vector of vectors.**If first element is +ve**, that means there is **no -ve number** by which we can make a **0 triplet sum.** Return empty vector of vectors.

## Two Pointer Approach:

The basic thinking logic for this is: Fix any one number in sorted array and find the other two numbers after it. The other two numbers can be easily found using two pointers (as array is sorted) and two numbers should have sum = -1*(fixed number).

Traverse the array and fix a number at every iteration.

If number fixed is +ve, break there because we can’t make it zero by searching after it.

If number is getting repeated, ignore the lower loop and continue. This is for unique triplets. We want the last instance of the fixed number, if it is repeated.

Make two pointers high and low, and initialize sum as 0.

Search between two pointers, just similiar to binary search. Sum = num[i] + num[low] + num[high].

If sum is -ve, means, we need more +ve numbers to make it 0, increament low (low++).

If sum is +ve, means, we need more -ve numbers to make it 0, decreament high (high–).

If sum is 0, that means we have found the required triplet, push it in answer vector.

Now again, to avoid duplicate triplets, we have to navigate to last occurences of num[low] and num[high] respectively. Update the low and high with last occurences of low and high.**My Two Pointer Solution:**

```
class Solution {
public:
vector> threeSum(vector& nums) {
sort(nums.begin() , nums.end()); //Sorted Array
if(nums.size() < 3){ //Base case 1 return {}; } if(nums[0] > 0){ //Base case 2
return {};
}
vector> answer;
for(int i = 0 ; i < nums.size() ; ++i){ //Traversing the array to fix the number. if(nums[i] > 0){ //If number fixed is +ve, stop there because we can't make it zero by searching after it.
break;
}
if(i > 0 && nums[i] == nums[i - 1]){ //If number is getting repeated, ignore the lower loop and continue.
continue;
}
int low = i + 1 , high = nums.size() - 1; //Make two pointers high and low, and initialize sum as 0.
int sum = 0;
while(low < high){ //Search between two pointers, just similiar to binary search. sum = nums[i] + nums[low] + nums[high]; if(sum > 0){ //If sum is +ve, means, we need more -ve numbers to make it 0, decreament high (high--).
high--;
} else if(sum < 0){ //If sum is -ve, means, we need more +ve numbers to make it 0, increament low (low++).
low++;
} else {
answer.push_back({nums[i] , nums[low] , nums[high]}); //we have found the required triplet, push it in answer vector
int last_low_occurence = nums[low] , last_high_occurence = nums[high]; //Now again, to avoid duplicate triplets, we have to navigate to last occurences of num[low] and num[high] respectively
while(low < high && nums[low] == last_low_occurence){ // Update the low and high with last occurences of low and high.
low++;
}
while(low < high && nums[high] == last_high_occurence){
high--;
}
}
}
}
return answer; //Return the answer vector.
}
};
```

HashMap Approach:

In this approach, firstly, we will hash the indices of all elements in a hashMap. In case of repeated elements, the last occurence index would be stored in hashMap.

Here also we fix a number (num[i]), by traversing the loop. But the loop traversal here for fixing numbers would leave last two indices. These last two indices would be covered by the nested loop.

If number fixed is +ve, break there because we can’t make it zero by searching after it.

Make a nested loop to fix a number after the first fixed number. (num[j])

To make sum 0, we would require the -ve sum of both fixed numbers. Let us say this required.

Now, we will find the this required number in hashMap. If it exists in hashmap and its last occurrence index > 2nd fixed index, we found our triplet. Push it in answer vector.

Update j to last occurence of 2nd fixed number to avoid duplicate triplets.

Update i to last occurence of 1st fixed number to avoid duplicate triplets.

Return answer vector.**My HashMap Solution:**

`class Solution {`

public:

vector> threeSum(vector& nums) {

sort(nums.begin() , nums.end()); //Sorted Array

if(nums.size() < 3){ // Base Case 1 return {}; } if(nums[0] > 0){ // Base Case 2

return {};

}

unordered_map hashMap;

for(int i = 0 ; i < nums.size() ; ++i){ //Hashing of Indices hashMap[nums[i]] = i; } vector> answer;

for(int i = 0 ; i < nums.size() - 2 ; ++i){ //Traversing the array to fix the number. if(nums[i] > 0){ //If number fixed is +ve, stop there because we can't make it zero by searching after it.

break;

}

for(int j = i + 1 ; j < nums.size() - 1 ; ++j){ //Fixing another number after first number int required = -1*(nums[i] + nums[j]); //To make sum 0, we would require the -ve sum of both fixed numbers. if(hashMap.count(required) && hashMap.find(required)->second > j){ //If it exists in hashmap and its last occurrence index > 2nd fixed index, we found our triplet.

answer.push_back({nums[i] , nums[j] , required});

}

j = hashMap.find(nums[j])->second; //Update j to last occurence of 2nd fixed number to avoid duplicate triplets.

}

i = hashMap.find(nums[i])->second; //Update i to last occurence of 1st fixed number to avoid duplicate triplets.

}

return answer; //Return answer vector.

}

};

Java :

```
class Solution {
public List<List<Integer>> threeSum(int[] nums) {
Arrays.sort(nums);
Set<List<Integer>> threeSum = new HashSet<>();
for(int i = 0; i < nums.length - 2; i++){
int j = i + 1;
int k = nums.length - 1;
while(j < k){
int sum = nums[i] + nums[j] + nums[k];
if(sum == 0){
List<Integer> temp = new ArrayList<>();
temp.add(nums[i]);
temp.add(nums[j]);
temp.add(nums[k]);
threeSum.add(temp);
j++;
k--;
}else if(sum > 0){
k--;
}else{
j++;
}
}
}
return new ArrayList<>(threeSum);
}
}
```

cpp

```
class Solution {
public:
vector<vector> threeSum(vector& nums) {
vector<vector> res;
sort(nums.begin(),nums.end());
for(int i = 0; i < nums.size();i++) {
if((i > 0) && nums[i]==nums[i-1]){
continue;
}
int left = i + 1;
int right = nums.size() - 1;
while (left < right) {
int sum = nums[i] + nums[left] + nums[right];
if(sum < 0){
left++;
}
else if(sum > 0){
right--;
}
else if(sum == 0) {
res.push_back(vector{nums[i],nums[left],nums[right]});
while (left < right && nums[left] == nums[left+1]){
left++;
}
while (left < right && nums[right] == nums[right-1]) {
right--;
}
left++;
right--;
}
}
}
return res;
}
};
```

Python:

```
class Solution:
def threeSum(self, nums: List[int]) -> List[List[int]]:
res=[]
nums.sort()
for i,a in enumerate(nums) :
if i > 0 and a==nums[i-1] :
continue
l,r=i+1,len(nums) -1
while l < r:
tsome = a + nums[l] +nums[r]
if tsome > 0 :
r -=1
elif tsome < 0 :
l +=1
else :
res.append([a,nums[l],nums[r]])
l +=1
while nums[l]==nums[l-1] and l<r :
l +=1
return res
```

## 1 thought on “Leet Code : Three (3) Sum Java | CPP | Python Solution”

__/\__ That’s all I could say.