Skip to content

problem8.md

Latest commit

 

History

History
15 lines (12 loc) · 542 Bytes

problem8.md

File metadata and controls

15 lines (12 loc) · 542 Bytes

Problem 8: Approximate Triplet Sum (3Sum Closest)

Problem Statement

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.

Input Format

  • An array of integers nums.
  • An integer target.

Example

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