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
• -10⁵ <= ARR[i] <= 10⁵
• -3 * 10⁵ <= target <= 3 * 10⁵

Note:

You are not required to print anything; just implement the function as directed.