Problem · Array
Three Sum Closest
● Medium
AmazonFULLTIMEPHONE SCREEN
See Amazon hiring insightsAmazonFULLTIMEPHONE SCREENProblem statement
Given an integer array nums and an integer target, choose three distinct indices and return the sum of their values that is closest to target.
The problem statement continues
ProExamples
Example 1
nums = [-1,2,1,-4]target = 1return = 2The closest sum is -1 + 2 + 1 = 2.
FastPrep Pro
Reported in 1 Amazon interview this weekUnlock this recently reported problem
FastPrep Pro gives you full access to interview problems reported within the last week.
- Full problem statement and constraints
- 2 more worked examples, explained
- Guided hints and editorial
- Run your code on real test cases
$8.25/month
$99 billed yearly — or $19 month-to-month. Cancel anytime.
Free plan — 2 of 2 free unlocks used this week