Given an array A of N integers, find three integers in A such that the sum is closest to a given number B. Return the sum of those three integers.
Assume that there will only be one solution.
First argument is an integer array A of size N.
Second argument is an integer B denoting the sum you need to get close to.
Return a single integer denoting the sum of three integers which is closest to B.
A = [-1, 2, 1, -4] B = 1
A = [1, 2, 3] B = 6
The sum that is closest to the target is 2. (-1 + 2 + 1 = 2)
Take all elements to get exactly 6.
NOTE: You only need to implement the given function. Do not read input, instead use the arguments to the function. Do not print the output, instead return values as specified. Still have a question? Checkout Sample Codes for more details.