Given an array of n integers and an integer “key”, find three integers in the array such that the sum is closest to key.

Input: [-1, 2, 1, -4] Key = 1 Output: The sum that is closest to the target is … Continue reading Given an array of n integers and an integer “key”, find three integers in the array such that the sum is closest to key.