3sum

by Arvind Pal

JavaScript

function findTriplets(arr,n )  { 
    var found = false; 
    for (let i=0; i<n-2; i++)  { 
        for (let j=i+1; j<n-1; j++)  { 
            for (let k=j+1; k<n; k++)    { 
            //console.log(arr[i],arr[j],arr[k])
                if (arr[i]+arr[j]+arr[k] == 0)   { 
                    console.log(arr[i],arr[j],arr[k])
                    found=true
                } 
            } 
        } 
    } 
    // If no triplet with 0 sum found in array 
    if (found == false) {
    
        console.log("no fount")
    }
} 
let arr = [-1, 0, 1, 2, -1, -4];
console.log(findTriplets(arr,6))