16. 3Sum Closest
MediumTwo Pointers
Given an integer array `nums` of length `n` and an integer `target`, find three integers in `nums` such that the sum is closest to `target`. Return the sum of the three integers. You may assume that each input would have exactly one solution.
Examples
Input: [-1,2,1,-4] 1
Output: 2
Explanation: The triple (-1, 1, 2) sums to 2, closest to target 1.
Constraints
- 3 <= nums.length <= 500
- -1000 <= nums[i] <= 1000
- -10^4 <= target <= 10^4
Loading...
Run checks all cases above. Submit evaluates all test cases.