Closest Sum Problem Statement
Given an array of integers ARR
of size N
and an integer target
, find three integers in ARR
such that their sum is closest to the target
. If there are two closest sums, return the smallest sum.
Input:
The first line contains an integer 'T' denoting the number of test cases.
For each test case:
- The first line contains an integer 'N', the size of the array.
- The second line contains 'N' space-separated integers representing the array.
- The third line contains an integer, the target.
Output:
For each test case, output the sum of the triplet that is closest to the target on a new line.
Example:
Input:
ARR = [1, 2, 3, 4, 5], target = 10
Output:
9
Constraints:
- 1 <= T <= 10
- 3 <= N <= 100
- -105 <= ARR[i] <= 105
- -3 * 105 <= target <= 3 * 105
Note:
You are not required to print anything; just implement the function as directed.
AnswerBot
3d
The task is to find three integers in an array whose sum is closest to a given target.
Iterate through all possible triplets in the array to find the closest sum to the target.
Keep track of the closest...read more
Vaishu Sumthankar
2y
Two - Pointer Approach By sorting the array the efficiency of the algorithm can be improved. This efficient approach uses the two-pointer technique. After sorting the array, traverse the array and f...read more
Help your peers!
Add answer anonymously...
Top Amazon Program Analyst interview questions & answers
Popular interview questions of Program Analyst
Stay ahead in your career. Get AmbitionBox app
Helping over 1 Crore job seekers every month in choosing their right fit company
65 L+
Reviews
4 L+
Interviews
4 Cr+
Salaries
1 Cr+
Users/Month
Contribute to help millions
Get AmbitionBox app