16. 3Sum Closest

Medium

8.9K

476

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.

**Example 1:**

Input:nums = [-1,2,1,-4], target = 1Output:2Explanation:The sum that is closest to the target is 2. (-1 + 2 + 1 = 2).

**Example 2:**

Input:nums = [0,0,0], target = 1Output:0Explanation:The sum that is closest to the target is 0. (0 + 0 + 0 = 0).

**Constraints:**

`3 <= nums.length <= 500`

`-1000 <= nums[i] <= 1000`

`-10`

^{4}<= target <= 10^{4}

Accepted

1M

Submissions

2.2M

Acceptance Rate

45.8%

Seen this question in a real interview before?

1/4

Yes

No

Discussion (0)

Related Topics

Copyright ©️ 2023 LeetCode All rights reserved