Code-360-Solutions/3Sum.cpp at main · Khushbu1824/Code-360-Solutions · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
vector<vector<int>> findTriplets(vector<int> arr, int n, int k) {
    sort(arr.begin(), arr.end());
    vector<vector<int>> ans;

    for(int i = 0; i < n - 2; i++)
	{
        if(i > 0 && arr[i] == arr[i - 1])
		{
            continue;
        }

        int left = i + 1;
        int right = n - 1;

        while(left < right)
		{
            int sum = arr[i] + arr[left] + arr[right];

            if(sum == k)
			{
                ans.push_back({arr[i], arr[left], arr[right]});

                while (left < right && arr[left] == arr[left + 1])
				{
                  left++;
                }

                while(left < right && arr[right] == arr[right - 1])
				{
					right--;
				}

                left++;
                right--;
            }

            else if(sum < k)
			{
                left++;
            }

            else
			{
                right--;
            }
        }
    }

    return ans;
}