Find Three Sum closest LeetCode (3 Sum Closest elements in array)

Given an array S of n integers, find three integers in S such that the sum is closest to a given number, target. Return the sum of the three integers. You may assume that each input would have exactly one solution.

    For example, given array S = {-1 2 1 -4}, and target = 1.

    The sum that is closest to the target is 2. (-1 + 2 + 1 = 2).

--------------------------------------------------------------------------------------

This is an interesting problem that is also found in LeetCode -3Sum Closest and GeeksForGeeks - Triplet sum closest A collection of hundreds of interview questions and solutions are available in our blog at Interview Question

Solution:

Source code: Java