Question

How to find all triplets with zero sum in a given array with C++

Answer 1

#include <iostream>

void findTripletsWith0Sum(int arr[], int size) {
    bool found = false;

    for (int i = 0; i < size - 2; i++) {
        for (int j = i + 1; j < size - 1; j++) {
            for (int k = j + 1; k < size; k++) {
                if (arr[i] + arr[j] + arr[k] == 0) {
                    std::cout << arr[i] << " + " << arr[j] << " + " << arr[k] << "\n";
                    found = true;
                }
            }
        }
    }

    if (found == false) {
        std::cout << "Not found";
    }
}

int main()
{
    int arr[] = { 1, 0, 3, 2, -1, -2, -3, 4 };
    int size = sizeof(arr) / sizeof(arr[0]);
    
    findTripletsWith0Sum(arr, size);
}





/*
run:

1 + 0 + -1
1 + 2 + -3
0 + 3 + -3
0 + 2 + -2
3 + -1 + -2
-1 + -3 + 4

*/

 

70+ SQL courses for beginners and professionals