Problems

11. 3Sum Closest

MediumTwo PointersAmazonGoogle

Given an integer array nums and an integer target, find three integers whose sum is closest to target.

Return the sum of the three integers. Each input has exactly one closest answer.

Example 1:

Input: nums = [-1,2,1,-4], target = 1
Output: 2

Example 2:

Input: nums = [0,0,0], target = 1
Output: 0

Constraints:

  • 3 <= nums.length <= 500
  • -1000 <= nums[i] <= 1000
Core code mode
● Auto-savedLine 1, column 1