Question

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

Answer 1

public class MyClass {
    private static void findTripletsWith0Sum(int[] arr) {
    	boolean found = false;
    	int size = arr.length;
    
    	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) {
    					System.out.println(arr[i] + " + " + arr[j] + " + " + arr[k]);
    					found = true;
    				}
    			}
    		}
    	}
    
    	if (found == false) {
    		System.out.print("Not found");
    	}
    }
    
    public static void main(String args[]) {
        int[] arr = {1, 0, 3, 2, -1, -2, -3, 4};
        
        findTripletsWith0Sum(arr);
    }
}






/*
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