// Javascript program to find a triplet

// returns true if there is triplet with sum equal

// to 'sum' present in A[]. Also, prints the triplet

function find3Numbers(A, arr_size, sum)

let l, r;

// Fix the first element as A[i]

for (let i = 0; i < arr_size - 2; i++)

{

// Fix the second element as A[j]

for (let j = i + 1; j < arr_size - 1; j++)

{

// Now look for the third number

for (let k = j + 1; k < arr_size; k++)

}

}

}

// If we reach here, then no triplet was found

return false;

/* Driver code */

let A = [ 1, 4, 45, 6, 10, 8 ];

let sum = 22;

let arr_size = A.length;

find3Numbers(A, arr_size, sum);

// This code is contributed by Mayank Tyagi