3Sum Closest Triplet Sum

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. ### Constraints - `3 <= nums.length <= 500` - `-1000 <= nums[i] <= 1000` - `-10^4 <= target <= 10^4` ### Input Format First line contains the target integer. Second line contains space-separated integers representing `nums`. ### Output Format Print the integer sum of the triplet that is closest to `target`.