# 15. 3Sum

## Problem Statement

<br>

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.

&#x20;

**Example 1:**

<pre><code><strong>Input: nums = [-1,0,1,2,-1,-4]
</strong><strong>Output: [[-1,-1,2],[-1,0,1]]
</strong><strong>Explanation: 
</strong>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.
</code></pre>

**Example 2:**

<pre><code><strong>Input: nums = [0,1,1]
</strong><strong>Output: []
</strong><strong>Explanation: The only possible triplet does not sum up to 0.
</strong></code></pre>

**Example 3:**

<pre><code><strong>Input: nums = [0,0,0]
</strong><strong>Output: [[0,0,0]]
</strong><strong>Explanation: The only possible triplet sums up to 0.
</strong></code></pre>

&#x20;

**Constraints:**

* `3 <= nums.length <= 3000`
* `-105 <= nums[i] <= 105`

## Intuition

```
Approach:

Fix one element and two sum for other two 
Use map to fix one, iterate in n^2 over other two
```

### Links

<https://leetcode.com/problems/3sum/description/>

### Video Links

### Approach 1:

```
Map and Set
```

{% code title="C++" lineNumbers="true" %}

```cpp
class Solution {
public:
    vector<vector<int>> threeSum(vector<int>& nums) {
        int n=nums.size();
        sort(nums.begin(), nums.end());
        vector<vector<int>> ans;
        unordered_map<int,int> mp;
        set<vector<int>> s;

        for(int i=0; i<n; i++)
            mp[nums[i]] = i;

        for(int i=0; i<n; i++){
            for(int j=i+1; j<n; j++){
                int k = -1 * (nums[i] + nums[j]);

                if(mp.find(k) != mp.end() and mp[k] > i and mp[k] > j){
                    s.insert({nums[i],nums[j],k});
                }
            }
        }

        for(auto &it: s)
            ans.push_back(it);

        return ans;
    }
};
```

{% endcode %}

### Approach 2:

```
```

{% code title="C++" lineNumbers="true" %}

```cpp
```

{% endcode %}

### Approach 3:

```
```

{% code title="C++" lineNumbers="true" %}

```cpp
```

{% endcode %}

### Approach 4:

```
```

{% code title="C++" lineNumbers="true" %}

```cpp
```

{% endcode %}

### Similar Problems

###


---

# Agent Instructions: Querying This Documentation

If you need additional information that is not directly available in this page, you can query the documentation dynamically by asking a question.

Perform an HTTP GET request on the current page URL with the `ask` query parameter:

```
GET https://coding-9.gitbook.io/untitled/array/hard/15.-3sum.md?ask=<question>
```

The question should be specific, self-contained, and written in natural language.
The response will contain a direct answer to the question and relevant excerpts and sources from the documentation.

Use this mechanism when the answer is not explicitly present in the current page, you need clarification or additional context, or you want to retrieve related documentation sections.